code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long int
#define fast ios_base::sync_with_stdio(false)
#define fast_input cin.tie(NULL)
#define fast_output cout.tie(NULL)
#define vi vector<long long int>
#define vii vector<vi>
#define vc vector<char>
#define vcc vector<vc>
#define vp vector<pair<ll,ll>>
#define vpp vector<pair<ll,pair<ll,ll>>>
#define pb push_back
#define pu push
#define po pop
#define up(v,x) upper_bound(v.begin(),v.end(),x)
#define lo(v,x) lower_bound(v.begin(),v.end(),x)
#define ups(v,x) v.upper_bound(x)
#define los(v,x) v.loer_bound(x)
#define pa pair<long long int ,long long int>
#define f(a,x,b) for(int a=x;a<b;a++)
#define fr(a,x,b) for(int a=x;a>=b;a--)
#define EACH(a,x) for(auto a:x)
#define sort(x) sort(x.begin(),x.end())
#define rev(x) reverse(x.begin(),x.end())
#define sz(a) (int)a.size()
#define mod 998244353
#define F first
#define S second
#define endl "\n"
#define um unordered_map<ll,ll>
#define ordered_set tree<pa, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx,
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
stringstream ss; ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
#ifdef XOX
#define debug(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define debug(...) 42
#endif
void solve(){
ll n;
cin>>n;
vi v(n);
f(i,0,n)
{
cin>>v[i];
}
stack<ll>s,s1;
ll ans=0;
vi nex(n,-1),prev(n,-1);
fr(i,n-1,0)
{
while(!s.empty()&&v[s.top()]>=v[i])
{
s.pop();
}
if(!s.empty())
{
nex[i]=s.top();
}
s.push(i);
}
f(i,0,n)
{
while(!s1.empty()&&v[s1.top()]>=v[i])
{
s1.pop();
}
if(!s1.empty())
{
prev[i]=s1.top();
}
s1.push(i);
}
f(i,0,n)
{
ll ge=nex[i],ge1=prev[i];
if(ge1==-1)
{
ge1=-1;
}
if(ge==-1)
{
ge=n;
}
ll go=v[i]*(ge-i+(i-1-ge1));
debug(i,ge,v[i],nex[i]);
ans=max(ans,go);
}
cout<<ans<<endl;
}
int main() {
fast;
fast_input;
fast_output;
// ll t;
// cin>>t;
// f(i,0,t)
// {
// cout<<"Case #"<<i+1<<":"<<" ";
solve();
// }
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
void coY() {cout <<"Yes"<<endl;}
void coN(){cout <<"No"<<endl;}
const int dy[] = {0,0,1,-1};
const int dx[] = {1,-1,0,0};
const ll mod = 1e9+7;
const ll MOD = 998244353;
const double PI=3.14159265358979323846;
const int INF = 1001001001;
//Write From this Line
ll C[201][201]; // C[n][k] -> nCk
void comb_table(int N){
for(int i=0;i<=N;++i){
for(int j=0;j<=i;++j){
if(j==0 or j==i){
C[i][j]=1LL;
}else{
C[i][j]=(C[i-1][j-1]+C[i-1][j]);
}
}
}
}
int main()
{
ll l;
cin >> l;
comb_table(199);
cout << C[l-1][11] << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define md 1000000007
using namespace std;
void divde(string& s){
ll i,crr=0,val;
for(i=0;i<s.length();i++){
val = s[i]-'0';
val+=10*crr;
if(val%2) {s[i]=val/2+'0';crr=1;}
else {s[i]=val/2+'0'; crr=0;}
}
if(s[0]=='0'){
reverse(s.begin(),s.end());
s.pop_back();
reverse(s.begin(),s.end());
}
}
int main(){
ll i,k,val;
string s;
cin>>s>>k;
for(i=0;i<k;i++){
if(s.length()>=3) val = s[s.length()-3]-'0';
if(s.length()<3 || (s.length()==3 && s<"200")) {
s+="200";
}
else if(s[s.length()-1]!='0' || s[s.length()-2]!='0' || val%2){
s+="200";
}
else {s.pop_back(); s.pop_back();
divde(s);
}
}
if(!s.empty()) cout<<s;
else cout<<"0";
return 0;} | #include<bits/stdc++.h>
#define int long long
using namespace std;
void solve(){
int n, m;
cin>>n>>m;
string s;
int count[2]{};
for(int i=0;i<n;i++){
cin>>s;
int one = 0;
for(auto x:s) one += (x-'0');
count[one%2]++;
}
cout<< count[0] * count[1] << "\n";
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define m 1000000007
using namespace std;
ll n,s,a,ans,f[3002],d[3002][3002];
int main(){
scanf("%lld",&n),d[1][0]=1;
for(int i=0;i<n;++i){
scanf("%lld",&a),s+=a;
for(int j=1;j<=n;++j){
f[j]=d[j][s%j];
d[j][s%j]=(d[j][s%j]+f[j-1])%m;
}
}
for(int i=1;i<=n;++i)ans=(ans+f[i])%m;
printf("%lld",ans);
return 0;
} | #include <bits/stdc++.h>
#define rep0(i,r) for (int i=0,i##end=r;i<i##end;++i)
#define rep(i,l,r) for (int i=l;i<=r;++i)
#define per(i,r,l) for (int i=r;i>=l;--i)
#define pr pair<int,int>
#define fi first
#define se second
#define ll long long
using namespace std;
const int N=5e3+3,P=998244353;
int a[N][N],pw[N],s1[N][N],s2[N][N],dp[N][N];
int main(){
int n,m,k; scanf("%d%d%d",&n,&m,&k);
rep(i,1,k){
int x,y; char s[5];
scanf("%d%d%s",&x,&y,s);
if (s[0]=='R') a[x][y]=1;
if (s[0]=='D') a[x][y]=2;
if (s[0]=='X') a[x][y]=3;
}
rep(i,1,n) rep(j,1,m)
s1[i][j]=s1[i][j-1]+(!a[i][j]),s2[i][j]=s2[i-1][j]+(!a[i][j]);
pw[0]=1; rep(i,1,max(n,m)) pw[i]=3LL*pw[i-1]%P;
dp[1][1]=1;
rep(i,1,n)
rep(j,1,m){
if (a[i][j]!=2) dp[i][j+1]=(dp[i][j+1]+(ll)pw[s2[i-1][j+1]]*(1+!a[i][j])%P*dp[i][j])%P;
if (a[i][j]!=1) dp[i+1][j]=(dp[i+1][j]+(ll)pw[s1[i+1][j-1]]*(1+!a[i][j])%P*dp[i][j])%P;
}
printf("%d\n",(ll)dp[n][m]*pw[!a[n][m]]%P);
return 0;
} |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n;
cin >> n;
int count=0;
for(int i=1;i<n+1;i++){
for(int j=1;j<n/i+1;j++){
count=count+n/(i*j);
}
}
cout << count;
return 0;
} | #pragma GCC optimize("O3")
#include "bits/stdc++.h"
#define sz(x) (int)(x).size()
using namespace std;
const int mxN = int(2e5) + 5;
int64_t numFactors[mxN],pref[mxN];
int n;
void calculateNumFactors(int value) {
for(int i=1; i*i<=value; i++) {
if(value % i == 0)
numFactors[value] += (i == value / i ? 1 : 2);
}
}
int findLargest(int value) {
int l = 1,r = n;
int res = -1;
while(l <= r) {
int mid = l + (r - l) / 2;
if(mid * 1LL * value <= n) {
res = mid;
l = mid + 1;
}
else
r = mid - 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i=1; i<=n; i++)
calculateNumFactors(i);
for(int i=1; i<=n; i++)
pref[i] = pref[i-1] + numFactors[i];
int64_t res = 0;
for(int first=1; first<=n; first++) {
int value = findLargest(first);
res += pref[value];
}
cout << res << "\n";
return 0;
}
|
/*
Hey why peeping here -_'_-?
I believe on myself and I will achieve
this->author = Fuad Ashraful Mehmet, CSE ,University of Asia Pacific
Todo:
https://codeforces.com/problemset?tags=1500-2300
*/
#include <bits/stdc++.h>
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define all(o) (o).begin(), (o).end()
#define rall(o) (o).rbegin(), (o).rend()
#define sz(o) int(o.size())
#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr);
#define dbg(o) cerr << "at " << __LINE__ << " response = " << o << endl;
#define dbgA(a,L,R) cerr<<#a<<"=[";for(int i=L;i<=R;i++) cerr<<a[i]<<(i==R?"]\n":" ");
#define dbgV(O) cerr << #O << "=["; for (auto o : O) cerr << o << ", "; cerr << "E]\n";
#define pb push_back
using namespace std;
using pii = pair<int, int>;
typedef long long ll;
int n,m,k,tc=1,len,q;
const int N=2e5+2,LOG=20;
int d[N],in[N],out[N],t=1;
vector<int>g[N],tree[N<<2];
void dfs(int from,int p,int l){
d[t]=l;
in[from]=t++;
for(int to:g[from])if(to!=p){
dfs(to,from,l+1);
}
out[from]=t-1;
}
void build(int l,int r,int nd=1){
if(l==r){
tree[nd].pb(d[l]);
return;
}
int mid=(l+r)>>1;
build(l,mid,nd<<1);
build(mid+1,r,nd<<1|1);
merge(all(tree[nd<<1]),all(tree[nd<<1|1]),back_inserter(tree[nd]));
return;
}
int query(int l,int r,int x,int y,int d,int nd=1){
if(l>y or r<x)return 0;
if(l>=x && r<=y){ // overlapped segment
//cout<<l<<" == "<<r<<endl;
//dbgV(tree[nd])
int idx1=lower_bound(all(tree[nd]),d)-tree[nd].begin();
int idx2=upper_bound(all(tree[nd]),d)-tree[nd].begin();
return idx2-idx1;
}
int mid=(l+r)>>1;
return query(l,mid,x,y,d,nd<<1)+query(mid+1,r,x,y,d,nd<<1|1);
}
void solve(){
cin>>n;
int x;
for(int i=2;i<=n;++i){
cin>>x;
g[i].pb(x);
g[x].pb(i);
}
dfs(1,0,0);
build(1,t-1,1);
//dbgA(d,1,t-1);
cin>>q;
int u,d;
while(q--){
cin>>u>>d;
//cout<<in[u]<<" -- "<<out[u]<<'\n';
cout<<query(1,t-1,in[u],out[u],d)<<'\n';
}
return;
}
int main(){
FAST_IO
//cout<<setprecision(20)<<fixed;
//cin>>tc;
while(tc--){
solve();
}
return 0;
} | #include<bits/stdc++.h>
using namespace std ;
const int maxn = 1e6 + 10 ;
typedef long long ll ;
int timstep , n ;
vector<int> g[maxn] ;
int in[maxn] , out[maxn] ;
vector<int> listt[maxn] ;
void dfs(int u , int dep){
in[u] = timstep++ ;
listt[dep].push_back(in[u]) ;
for(auto v : g[u])
dfs(v , dep + 1) ;
out[u] = timstep++ ;
}
int main(){
int n ;
cin >> n ;
for(int v = 1 ; v < n ; v++){
int u ;
cin >> u ;
u-- ;
g[u].push_back(v) ;
}
dfs(0 , 0) ;
int q ;
cin >> q ;
for(int i = 0 ; i < q ; i++){
int u , d ;
cin >> u >> d ;
u-- ;
cout << lower_bound(listt[d].begin() , listt[d].end() , out[u]) - lower_bound(listt[d].begin() , listt[d].end() , in[u]) << endl ;
}
return 0 ;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, s, n) for (ll i = s; i < (ll)(n); i++)
int main() {
ll N, M;
cin >> N >> M;
vector<ll> A(M);
rep(i, 0, M) { cin >> A[i]; }
if (M == 0) {
cout << 1 << endl;
return 0;
}
sort(A.begin(), A.end());
vector<ll> dif;
ll prev = 0;
rep(i, 0, M) {
ll num = A[i] - prev - 1;
if (num != 0) {
dif.push_back(num);
}
prev = A[i];
}
ll la = N - A[M - 1];
if (la != 0) {
dif.push_back(la);
}
ll k = 1001001001;
for (auto di : dif) {
k = min(k, di);
}
ll ans = 0;
for (auto di : dif) {
if (di % k == 0) {
ans += di / k;
} else {
ans += di / k + 1;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
ll gcd(ll n, ll m)
{
ll tmp;
while (m != 0)
{
tmp = n % m;
n = m;
m = tmp;
}
return n;
}
ll lcm(ll n, ll m)
{
return abs(n) / gcd(n, m) * abs(m); //gl=xy
}
using namespace std;
//using namespace atcoder;
void solve(){
ll n,m;
cin>>n>>m;
if(m<0){
cout<<-1;
return;
}
if(m==0){
ll x=1;
rep(i,n){
cout<<x<<" "<<x+1<<"\n";
x+=2;
}
return;
}
if(m>=n-1){
cout<<-1;
return;
}
vector<pair<ll,ll>>ans;
ll maxv=1000000000;
ans.eb(1,maxv);
rep(i,n-m-2){
ans.eb(2+i,maxv-(i+1));
}
ll left=n-m-1;
rep(i,m+1){
ans.eb(left+1,left+2);
left+=2;
}
for(auto x:ans){
cout<<x.first<<" "<<x.second<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
solve();
return 0;
}
|
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
tuple<ll, ll, ll> extgcd(ll a, ll b){
if (b == 0) return {a,1,0};
ll g, x, y;
tie(g, x, y) = extgcd(b, a%b);
return {g, y, x-a/b*y};
}
void solve(){
ll n, s, k;
cin >> n >> s >> k;
ll g, x, y;
tie(g,x,y) = extgcd(k, n);
if (s%g != 0){
cout << -1 << endl;
return;
}
n /= g;
s /= g;
k /= g;
ll ans = ((x*-s)%n+n)%n;
cout << ans << endl;
}
int main(){
int t;
cin >> t;
rep(i, t) solve();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define OUT(V) for(int i=0;i<(int)V.size();++i){cout<<V[i]<<" ";}cout<<endl;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
map<int, ll> mp;
REP(i, N) {
string S;
cin >> S;
int cnt = 0;
REP(j, S.size()) {
if(S[j] == '1')cnt++;
}
mp[cnt % 2]++;
}
cout << mp[0] * mp[1] << endl;
} |
#include<bits//stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//type define....
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int u_int;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> v_i;
typedef vector<ll> v_ll;
typedef vector<pair<int,int>> v_pii;
typedef vector<pair<ll,ll>> v_pll;
typedef set<int> s_i;
typedef set<ll> s_ll;
typedef map<int,int> map_ii;
typedef map<ll,ll> map_ll;
typedef priority_queue<int> max_heap_i;
typedef priority_queue<int,vector<int>,greater<int>> min_heap_i;
typedef priority_queue<ll> max_heap_ll;
typedef priority_queue<ll,vector<ll>,greater<ll>> min_heap_ll;
typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> pbds_set;
//END OF TYPE DEFINE
//Macros define
#define F first
#define S second
#define PB push_back
#define IN insert
#define RIL(i,a,b) for(int i=a;i<b;i++)
#define RIL_K(i,a,b,k) for(int i=a;i<b;i+=k)
#define RDL(i,a,b) for(int i=a;i>=b;i--)
#define RDL_K(i,a,b,k) for(int i=a;i>=b;i-=k)
#define all(v) v.begin(),v.end()
#define MAX(a,b,c) (max(a,max(b,c)))
#define MIN(a,b,c) (min(a,min(b,c)))
//End of Macros
v_i v;
int ans=-1;
int n;
int fun(int lo,int hi)
{
if(hi==lo+1)
{
return (v[lo]>v[hi]? lo:hi);
}
int mid=lo+(hi-lo)/2;
int left=fun(lo,mid);
int right=fun(mid+1,hi);
if((hi-lo)==((1<<n)-1))
{
ans=((v[left]>v[right])? right:left);
}
return ((v[left]>v[right])? left:right);
}
void solve()
{
//int n;
cin>>n;
v.resize(1<<n);
RIL(i,0,1<<n) cin>>v[i];
int idx1=0;
RIL(i,0,1<<(n-1))
{
if(v[i]>v[idx1])
{
idx1=i;
}
}
int idx2=1<<(n-1);
RIL(i,1<<(n-1),1<<n)
{
if(v[i]>v[idx2])
{
idx2=i;
}
}
cout<<(v[idx1]<v[idx2]? idx1:idx2)+1<<endl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin>>t;
RIL(i,0,t)
{
solve();
}
}
| #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using namespace std;
using P = pair<long long, long long>;
const long long INF = 1000000000000000000;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<vector<int>> data(200000, vector<int>(0));
rep(i, 0, n) cin >> a.at(i);
rep(i, 0, n/2) {
if (a.at(i) != a.at(n-1-i)) {
data.at(a.at(i)-1).push_back(a.at(n-1-i)-1);
data.at(a.at(n-1-i)-1).push_back(a.at(i)-1);
}
}
int ans = 0;
vector<bool> seen(200000, false);
queue<int> que;
rep(i, 0, 200000) {
if (!seen.at(i)) {
que.push(i);
seen.at(i) = true;
}
while (!que.empty()) {
int x = que.front();
que.pop();
for (int y : data.at(x)) {
if (!seen.at(y)) {
seen.at(y) = true;
que.push(y);
ans++;
}
}
}
}
cout << ans << endl;
} |
#include <iostream>
using namespace std;
int main(){
int x;
cin >> x;
cout << max(0,x) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int x;
cin>>x;
if(x>=0){
cout<<x<<endl;
}else {
cout<<"0"<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
if(C == 0)
{
if(A > B) cout << "Takahashi" << endl;
else cout << "Aoki" << endl;
}
else
{
if(B > A) cout << "Aoki" << endl;
else cout << "Takahashi" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX32 = 2147483647;
const long long MAX64 = 9223372036854775807;
const double PI = 3.14159265358979323846;
int main() {
int n, x;
string s;
cin >> n >> x >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'o') {
x++;
} else if (x > 0) {
x--;
}
}
cout << x << endl;
} |
#include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) (int)a.size()
#define V vector
#define ld long double
#define viit(a) vector<int>::iterator a
#define IT iterator
#define SET setprecision
#define FOR(i,a,n) for(int i=a;i<=(n);i++)
#define ER1(a) a.erase(a.begin())
#define ER0(a) a.erase(a.end())
#define pii pair<int,int>
#define pause system("PAUSE")
#define cls system("CLS")
#define mod1 1000000007
#define mod2 998244353
#define infmod 9223372036854775783
#define tc int t;cin>>t;while(t--)solve();
#define over(x) {cout<<x<<endl;return;}
#define intsz(x) (int)sz(to_string(x))
using namespace std;
int n;
bool found[200];
vector<char> v;
int m[200];
string s[20];
bool used[20];
int ans;
void dfs(int pos){
if(pos==v.size()){
int sum=0;
REP(i,0,n){
int now=0;
if(m[s[i][0]]==0) return;
REP(j,0,s[i].size())now=now*10+m[s[i][j]];
if(i!=n-1)sum+=now;
else sum-=now;
}
if(sum==0){
REP(i,0,n){
REP(j,0,s[i].size())
cout<<m[s[i][j]];
cout<<endl;
}
exit(0);
}
return;
}
REP(i,0,10)
if(!used[i]){
used[i]=1;
m[v[pos]]=i;
dfs(pos+1);
m[v[pos]]=0;
used[i]=0;
}
}
signed main(){
n=3;
REP(i,0,n){
cin>>s[i];
REP(j,0,s[i].size())found[s[i][j]]=1;
}
for(int i=1;i<127;i++)
if(found[i]){
bool flag=1;
REP(j,0,v.size())
if(v[j]==i)flag=0;
if(flag)v.pb(i);
}
dfs(0);
cout<<"UNSOLVABLE";
return 0;
} | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#define REP(i,n) for(int i=0;i<(int)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define INF 1000000000
using namespace std;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
using ll = long long;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
string S1, S2, S3;
vector<char> v;
vector<int> p;
int pos(char c) {
REP(i, SZ(v)) {
if (v[i] == c)return i;
}
return -1;
}
int main() {
cin >> S1 >> S2 >> S3;
REP(i, SZ(S1)) {
if (find(ALL(v), S1[i]) == v.end()) {
v.pb(S1[i]);
}
}
REP(i, SZ(S2)) {
if (find(ALL(v), S2[i]) == v.end()) {
v.pb(S2[i]);
}
}
REP(i, SZ(S3)) {
if (find(ALL(v), S3[i]) == v.end()) {
v.pb(S3[i]);
}
}
sort(ALL(v));
if (SZ(v) > 10) {
cout << "UNSOLVABLE" << endl;
return 0;
}
REP(i, 10) {
p.pb(i);
}
do {
string s1 = "", s2 = "", s3 = "";
bool cont = false;
REP(i,SZ(S1)){
s1 += (char)(p[pos(S1[i])] + '0');
if (i == 0 && p[pos(S1[i])] == 0) {
cont = true;
}
}
REP(i, SZ(S2)) {
s2 += (char)(p[pos(S2[i])] + '0');
if (i == 0 && p[pos(S2[i])] == 0) {
cont = true;
}
}
REP(i, SZ(S3)) {
s3 += (char)(p[pos(S3[i])] + '0');
if (i == 0 && p[pos(S3[i])] == 0) {
cont = true;
}
}
if (cont)continue;
ll ss1, ss2, ss3;
ss1 = stoll(s1);
ss2 = stoll(s2);
ss3 = stoll(s3);
if (ss1 + ss2 == ss3) {
cout << ss1 << endl << ss2 << endl << ss3 << endl;
return 0;
}
} while (next_permutation(ALL(p)));
cout << "UNSOLVABLE" << endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define se second
#define pll pair<LL, LL>
#define pii pair<int, int>
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define SZ(x) ((int)(x.size()))
#define LC (id<<1)
#define RC (id<<1|1)
constexpr int N = 1e5+9;
constexpr int M = 998244353;
#ifdef int
constexpr int INF = 0x3f3f3f3f3f3f3f3f;
constexpr int INF2 = 0xcfcfcfcfcfcfcfcf;
#else
constexpr int INF = 0x3f3f3f3f;
constexpr int INF2 = 0xcfcfcfcf;
#endif
signed main() {
fastio;
int n;
cin >> n;
vector<int> a(n);
map<int, int> dp;
for (int& x: a)
cin >> x;
int mini = *min_element(a.begin(), a.end());
for (int& x: a) {
for (int g1 = 1; g1 * g1 <= x; g1++) {
if (x % g1 == 0) {
dp[g1] = __gcd(dp[g1], x);
int g2 = x/g1;
if (g1 == g2) continue;
dp[g2] = __gcd(dp[g2], x);
}
}
}
int ans = 1;
for (auto& [x, y]: dp)
if (x < mini)
ans += x==y;
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define N 2005
#define mod 998244353
#define LL long long
int n, a_min, i, a[N], j, ans;
vector<int> vec;
unordered_set<int> Ans;
map<int,int> A, ext;
int main (void)
{
scanf("%d",&n);
a_min=-1;
for (i=1; i<=n; i++) {
scanf("%d",&a[i]);
if (a_min==-1) a_min=a[i];
else a_min=min(a_min,a[i]);
vec.clear();
for (j=1; j*j<=a[i]; j++)
if (a[i]%j==0) {
vec.push_back(j);
if (j*j!=a[i]) vec.push_back(a[i]/j);
}
sort(vec.begin(),vec.end());
ext.clear();
for (j=vec.size()-1; j>=0; j--) {
if (ext.count(A[vec[j]])) continue;
ext[A[vec[j]]]=1;
Ans.insert(vec[j]);
}
for (j=0; j<vec.size(); j++) A[vec[j]]=((LL)A[vec[j]]*n+i)%mod;
}
ans=0;
for (auto x:Ans) if (x<=a_min) ans++;
printf("%d\n",ans);
return 0;
} |
#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
unordered_map<int, int> um;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
um[t]++;
}
int res = 0;
for (int i = 0; i < k; i++) {
int index = 0;
while (um[index] > 0) {
um[index]--;
index++;
}
res += index;
}
cout << res << endl;
}
| //#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " << (x) << endl; \
}
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) (((n) >> (k)) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
if (a > b) {
a = b;
return 1;
} else
return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
} else
return 0;
}
void Yes(bool flag = true) {
if (flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void No(bool flag = true) {
Yes(!flag);
}
void YES(bool flag = true) {
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void NO(bool flag = true) {
YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = true;
} // namespace mydef
using namespace mydef;
#define pb push_back
//#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans
int H, W;
vector<string> S;
void solve() {
auto check = [&](int i, int j) {
return (S[i][j] + S[i][j + 1] + S[i + 1][j] + S[i + 1][j + 1]) % 2 == 1;
};
int ans = 0;
for (int i = 0; i < H - 1; i++) {
for (int j = 0; j < W - 1; j++) {
ans += check(i, j);
}
}
cout << ans << endl;
}
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> H >> W;
S.resize(H);
for (int i = 0; i < H; i++) {
cin >> S[i];
for (auto& c : S[i])
c = c == '#';
}
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define sync ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb(a) push_back(a);
#define ll long long int
using namespace std;
int main()
{
sync
string s;
cin >> s;
int i;
reverse(s.begin(), s.end());
for(i=0; i<s.size(); i++){
if(s[i]=='6'){
s[i]='9';
}
else if(s[i]=='9'){
s[i]='6';
}
}
cout << s << endl;
} | #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
#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 deb(x) cout << #x << " is " << x << "\n"
#define int long long
#define MOD 1000000007LL
#define PI acos(-1)
template <typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using max_heap = priority_queue<T>;
template <class T>
using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename... T>
void read(T &...args) {
((cin >> args), ...);
}
template <typename... T>
void write(T &&...args) {
((cout << args), ...);
}
template <typename T>
void readContainer(T &t) {
for (auto &e : t) {
read(e);
}
}
template <typename T>
void writeContainer(T &t) {
for (const auto &e : t) {
write(e, " ");
}
write("\n");
}
void solve(int tc) {
string s;
read(s);
map<char, char> mp;
mp['0'] = '0';
mp['6'] = '9';
mp['9'] = '6';
mp['8'] = '8';
mp['1'] = '1';
for (int i = s.size() - 1; i >= 0; --i) {
write(mp[s[i]]);
}
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tc = 1;
// read(tc);
for (int curr = 1; curr <= tc; ++curr) {
solve(curr);
}
return 0;
} |
#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 <iomanip> // setprecision
#include <complex> // complex
#include <math.h>
#include <functional>
#include <cassert>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
const int MX = 1505;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int h, w;
bool light[MX][MX];
bool wall[MX][MX];
bool ok[MX][MX];
bool visited[MX][MX];
bool memo[MX][MX];
bool f(int v, int i, int j){
if(i < 0 || i >= h || j < 0 || j >= w) return false;
if(wall[i][j]) return false;
if(light[i][j]) return true;
if(visited[i][j]) return memo[i][j];
visited[i][j] = true;
return memo[i][j] = f(v, i+di[v], j+dj[v]);
}
int main()
{
int n, m;
cin >> h >> w >> n >> m;
rep(i, 0, n){
int a, b;
cin >> a >> b;
a--; b--;
light[a][b] = true;
}
rep(i, 0, m){
int c, d;
cin >> c >> d;
c--; d--;
wall[c][d] = true;
}
rep(v, 0, 4){
rep(i, 0, h) rep(j, 0, w) visited[i][j] = false;
rep(i, 0, h) rep(j, 0, w) if(f(v, i, j)) ok[i][j] = true;
}
int ans = 0;
rep(i, 0, h) rep(j, 0, w) if(ok[i][j]) ans++;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename key>
using ordered_set = tree<key, null_type, less<key>, rb_tree_tag, tree_order_statistics_node_update>;
#define F first
#define S second
#define T second.first
#define C second.second
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
#define all(v) v.begin(),v.end()
#define OO 0x3f3f3f3fLL
#define INF 0x3f3f3f3f3f3f3f3fLL
#define sz(s) (int)(s.size())
#define RT(s) return cout<<s,0
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef pair<ll,pair<ll,ll>> piii;
const int N = 1e5+5, M= 20, mod = 1e4+7, base = 15;
const double EPS = 1e-8;
int cnt[10000];
void solve(int n){
int i;
for(i=1; i*i<n; i++){
if(n%i == 0){
cnt[n/i]++;
cnt[i]++;
}
}
if(i*i == n)
cnt[i]++;
}
int main(){
FIO
// freopen("calc.in", "r", stdin);
// freopen("calc.out", "w", stdout);
int n, m, l, b;
int x,y;
cin>>n>>m>>l>>b;
int A[n][m], ans[n][m];
memset(A, 0, sizeof A);
memset(ans, 0, sizeof ans);
for(int i=0; i<l; i++){
cin>>x>>y;
x--, y--;
A[x][y] = 1;
}
for(int i=0; i<b; i++){
cin>>x>>y;
x--, y--;
A[x][y] = 2;
}
for(int i=0; i<n; i++){
bool f = 0;
for(int j=0; j<m; j++){
if(A[i][j] == 1){
f = 1;
}
if(f && A[i][j]!=2)
ans[i][j] = 1;
if(A[i][j] == 2)
f = 0;
}
}
for(int i=0; i<n; i++){
bool f = 0;
for(int j=m-1; ~j; j--){
if(A[i][j] == 1){
f = 1;
}
if(f && A[i][j]!=2)
ans[i][j] = 1;
if(A[i][j] == 2)
f = 0;
}
}
for(int j=0; j<m; j++){
bool f = 0;
for(int i=0; i<n; i++){
if(A[i][j] == 1){
f = 1;
}
if(f && A[i][j]!=2)
ans[i][j] = 1;
if(A[i][j] == 2)
f = 0;
}
}
for(int j=0; j<m; j++){
bool f = 0;
for(int i=n-1; ~i; i--){
if(A[i][j] == 1){
f = 1;
}
if(f && A[i][j]!=2)
ans[i][j] = 1;
if(A[i][j] == 2)
f = 0;
}
}
int cnt = 0;
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
cnt += ans[i][j];
cout<<cnt;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 2e3 + 5;
struct interval { int l, r, t; } a[N];
int n, ans;
bool check (int x, int y) {
if(a[x].r > a[y].r) swap(x, y);
if(a[x].r > a[y].l) return true;
if(a[x].r < a[y].l) return false;
if(a[x].t == 2 || a[x].t == 4 || a[y].t == 3 || a[y].t == 4) return false;
return true;
}
signed main () {
// freopen ("C.in", "r", stdin);
cin >> n;
rep(i, 1, n) cin >> a[i].t >> a[i].l >> a[i].r;
rep(i, 1, n) rep(j, i + 1, n) if(check(i, j)) ++ans;
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define MAX (ll)(2e5 + 7)
#define INF (ll)(1e18 + 7)
#define MOD (ll)(998244353)
using namespace std;
using ll = long long;
using cd = complex<double>;
using ul = unsigned long;
void f_io () {
ios_base :: sync_with_stdio (false);
cin.tie (nullptr);
}
ll f[MAX], t[MAX];
void up (ll ind, ll v) {
for (ll i = ind; i < MAX; i += i & (-i)) {
f[i] += v;
}
}
ll qu (ll ind) {
ll s = 0;
for (ll i = ind; i; i -= i & (-i)) {
s += f[i];
}
return s;
}
ll mult (ll a, ll b) {
return (((a % MOD) * (b % MOD)) % MOD);
}
ll add (ll a, ll b) {
b = (((b % MOD) + MOD) % MOD);
return (a % MOD + b % MOD) % MOD;
}
ll pw (ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1) {
r = mult (r, a);
}
b >>= 1;
a = mult (a, a);
}
return r;
}
ll ncr (ll n , ll r) {
if (r < 0 || n < 0 || n < r) return 0;
return mult (f[n], pw (mult (f[n - r], f[r]), MOD -2 ));
}
void sieve () {
for (ll i = 1; i < MAX; i++) {
for (ll j = i; j < MAX; j += i) {
f[j]++;
}
}
}
ll gc (ll a, ll b) {
if (!a || !b) {
return max (a, b);
}
ll r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
return b;
}
vector<pair<int, int>> gr[MAX], vvs;
vector<pair<string, int>> vs;
vector<pair<int, string>> fe[MAX];
map<string, int> ma;
int main () {
int n;
cin >> n;
int g = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
g = gc (x, g);
}
cout << g << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;cin>>n;
if(floor(n*1.08)<206)cout<<"Yay!"<<endl;
else if(floor(n*1.08)==206)cout<<"so-so"<<endl;
else cout<<":("<<endl;
} | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define endl '\n'
using namespace std;
int Power(int Num,int Index){
int r=1 ;
for(int i=Index;i>0;i/=2,Num*=Num){
if(i%2==1){
r*=Num ;
}
}
return r ;
}
int Factorial(int Number){
int m=1;
for(int i=1;i<=Number;i++){
m*=i;
}
return m;
}
int BinToDec(string Bin){
int n=0;
for(int i=Bin.size()-1;i>=0;i--){
n+=(Bin[Bin.size()-1-i]-'0')*Power(2,i);
}
return n;
}
int HexadecToDec(string Hex){
int n=0;
for(int i=Hex.size()-1;i>=0;i--){
if(Hex[i]>='A'&&Hex[i]<='F'){
n+=(Hex[i]-'A'+10)*Power(16,Hex.size()-i-1);
}
else{
n+=(Hex[i]-'0')*Power(16,Hex.size()-1-i);
}
}
return n;
}
int nCr(int Num1,int Num2){
int k=1;
for(int i=Num1-Num2+1;i<=Num1;i++){
k*=i;
}
int x=k/(Factorial(Num2));
return x;
}
string DecToBin(int Num){
string k="";
while(Num){
int r=Num%2;
string a=to_string(r);
k+=a;
Num/=2;
}
reverse(k.begin(),k.end());
return k;
}
string DecToHexadec(int Num){
string k="";
while(Num){
int r=Num%16;
if(r<=9){
string a=to_string(r);
k+=a;
}
else{
k+=(r-10+'A');
}
Num/=16;
}
reverse(k.begin(),k.end());
return k;
}
bool VowelChecker(char Letter){
Letter=tolower(Letter);
if(Letter=='a'||Letter=='e'||Letter=='i'||Letter=='o'||Letter=='u'){
return true;
}
else{
return false;
}
}
bool PrimeChecker(int Num){
bool ok=true;
for(int i=2;i<=sqrt(Num);i++){
if(Num%i==0){
ok=false;
}
}
if(ok==true){
return true;
}
else{
return false;
}
}
bool Palindrome(string Word){
string c=Word;
reverse(c.begin(),c.end());
if(c==Word){
return true;
}
else{
return false;
}
}
vector<int> Factors(int Num){
vector<int>s;
for(int i=1;i*i<=Num;i++){
if(Num%i==0){
if(Num/i==i){
s.push_back(i) ;
}
else{
s.push_back(i) ;
s.push_back(Num/i) ;
}
}
}
sort(s.begin(),s.end());
return s ;
}
vector<int> PrimeFactorisation(int Num){
vector<int>p;
while(Num%2==0){
p.push_back(2);
Num/=2;
}
for(int i=3;i<=sqrt(Num);i+=2){
while(Num%i==0){
p.push_back(i);
Num/=i;
}
}
if(Num>2){
p.push_back(Num);
}
return p;
}
vector<int> SieveOfEratosthenes(int Num){
vector<int>s;
bool prime[Num+1];
memset(prime,true,sizeof(prime));
for(int p=2;p*p<=Num;p++){
if (prime[p]==true){
for(int i=p*p;i<=Num;i+=p){
prime[i]=false;
}
}
}
for (int p=2;p<=Num;p++){
if (prime[p]){
s.push_back(p);
}
}
return s;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tc ;
tc = 1 ;
// cin >> tc ;
while(tc--){
int n;cin>>n;
int x=(108*n)/100;
int y=206;
if(x<y){
cout << "Yay!" ;
}
else if(x==y){
cout << "so-so";
}
else{
cout << ":(";
}
}
return 0;
} |
#include <bits/extc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i=0;i<int(n);i++)
#define FOR(i,a,b) for(int i=a;i<=int(b);i++)
#define ALL(x) x.begin(),x.end()
vector<vector<tuple<int, ll, ll, ll>>> gr;
vector<ll> ans;
signed main() {
int n, m;
ll inf = 1000100010001000;
cin >> n >> m;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
gr.resize(n);
ans.resize(n, inf);
REP(i, m){
int a, b;
double c, d;
cin >> a >> b >> c >> d;
a--;b--;
ll t = (ll)((sqrt(1 + 4 * d) - 1) / 2);
if(a==b)continue;
gr[a].push_back({b, (ll)c, (ll)d, t});
gr[b].push_back({a, (ll)c, (ll)d, t});
}
pq.push({0, 0});
while(!pq.empty()){
ll now = pq.top().first;
int x = pq.top().second;
pq.pop();
if (ans[x] < now)continue;
for(auto tap: gr[x]){
int to = get<0>(tap);
ll c = get<1>(tap);
ll d = get<2>(tap);
ll t = get<3>(tap);
if(t>now){
ll cost = t + c + d / (t + 1);
if(cost < ans[to]){
ans[to] = cost;
pq.push({ans[to], to});
}
} else {
ll cost = now + c + d / (now+1);
if(cost < ans[to]){
ans[to] = cost;
pq.push({ans[to], to});
}
}
}
}
if(ans[n-1]==inf){
cout << -1;
}else{
cout << ans[n-1];
}
return 0;
} | #include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define ll long long
using namespace std;
#define MOD 1000000007
#define INF 100000000000000000
ll calc(ll currTime, ll waitTime, ll edgeCost) {
return waitTime + edgeCost / (currTime + waitTime + 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
// {dest, {c, d}}
vector<vector<pair<ll, pll>>> edges(n + 1);
for (int i = 0; i < m; i++) {
ll u, v, c, d;
cin >> u >> v >> c >> d;
edges[u].push_back({v, {c, d}});
edges[v].push_back({u, {c, d}});
}
vector<ll> dist(n + 1, INF);
dist[1] = 0;
// {{time, city}}
priority_queue<pll, vector<pll>, greater<pll>> q;
q.push({0, 1});
while (!q.empty()) {
pll p = q.top();
q.pop();
ll node = p.second;
ll currTime = p.first;
if (currTime > dist[node]) continue;
for (auto edge : edges[node]) {
ll dest = edge.first;
// edgeCost = c + bs(currTime, d)
ll waitTime = calc(currTime, 0, edge.second.second);
ll critPoint = sqrt(edge.second.second) - currTime - 1;
for (ll i = max(0LL, critPoint - 3); i <= max(0LL, critPoint + 3); i++) {
waitTime = min(waitTime, calc(currTime, i, edge.second.second));
}
// ll edgeCost = edge.second.first + waitTime + edge.second.second / (currTime + waitTime + 1);
ll edgeCost = edge.second.first + waitTime;
if (dist[node] + edgeCost < dist[dest]) {
q.push({dist[node] + edgeCost, dest});
dist[dest] = dist[node] + edgeCost;
}
}
}
// cout << 1 + calc(0, 89, 10000) << '\n';
if (dist[n] >= INF) cout << "-1\n";
else cout << dist[n] << '\n';
}
/*
2 1
1 2 1 10000
*/
|
#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long int
#define ll long long int
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define mem memset
#define ff first
#define ss second
#define loop0(i,n) for(i=0;i<n;i++)
#define loop1(i,n) for(i=1;i<=n;i++)
ll dist(pair<ll,ll> p1,pair<ll,ll> p2)
{
return max(abs(p1.ff-p2.ff),abs(p1.ss-p2.ss));
}
int main()
{
ll n,i,j,x,y,k,l,a,b;
cin>>n;
pair<pair<ll,ll>,ll> p[n],q[n];
loop0(i,n)
{
cin>>x>>y;
p[i]={{x,y},i};
q[i]={{y,x},i};
}
sort(p,p+n);
sort(q,q+n);
priority_queue<ll> pq;
map<pair<ll,ll>,ll> mp;
ll ans;
a=p[0].ss;b=p[n-1].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(p[0].ff,p[n-1].ff));
mp[{x,y}]=1;
}
a=p[0].ss;b=p[n-2].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(p[0].ff,p[n-2].ff));
mp[{x,y}]=1;
}
a=p[1].ss;b=p[n-1].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(p[1].ff,p[n-1].ff));
mp[{x,y}]=1;
}
a=q[0].ss;b=q[n-1].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(q[0].ff,q[n-1].ff));
mp[{x,y}]=1;
}
a=q[0].ss;b=q[n-2].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(q[0].ff,q[n-2].ff));
mp[{x,y}]=1;
}
a=q[1].ss;b=q[n-1].ss;
x=min(a,b);y=max(a,b);
if(!mp[{x,y}])
{
pq.push(dist(q[1].ff,q[n-1].ff));
mp[{x,y}]=1;
}
pq.pop();
ans=pq.top();
cout<<ans<<'\n';
return 0;
} | #include <bits/stdc++.h>
#define rei register int
using namespace std;
const int N=2e5+100;
int a[N],num[N],ans[N];
int n,p;
bool used[N];
inline void change(int j){
used[j]=true;
ans[++p]=j;
num[a[j]]=j+1;
num[a[j+1]]=j;
swap(a[j],a[j+1]);
}
int main(){
cin>>n;
for(rei i=1;i<=n;++i){
cin>>a[i];
num[a[i]]=i;
}
memset(used,false,sizeof used);
for(rei i=1;i<=n;++i)
for(rei j=num[i]-1;j>=i;--j){
if(used[j]){
puts("-1");
return 0;
}
change(j);
}
if(p!=n-1){
puts("-1");
return 0;
}
for(rei i=1;i<=n-1;++i)
cout<<ans[i]<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353;
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T>
void remove_duplication(vector<T> &v){
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
void check(vector<string>& S){
int n = S.size(), m = S[0].size();
vector<Pair> v;
REP(i,m)FOR(j,i+1,m){
int c1=0, c2=0;
REP(k,n) if(S[k][i]==S[k][j]) c1++; else c2++;
v.emplace_back(c1,c2);
}
remove_duplication(v);
if(v.size()==1) cout << "Yes" << en;
else cout << "No" << en;
return;
}
string rev(string& s){
int n = s.size();
string ret(n,'A');
REP(i,n) if(s[i]=='A') ret[i]='B';
return ret;
}
void Main(){
int N; cin >> N;
vector<string> s;
REP(i,N){
vector<string> t; t.emplace_back(string(1<<i,'A') + string(1<<i,'B'));
for(string u : s){
t.emplace_back(""); t.back() += u; t.back() += u;
t.emplace_back(""); t.back() += u; t.back() += rev(u);
}
swap(s,t);
}
//check(s);
int K = s.size();
cout << K << en;
REP(i,K) cout << s[i] << en;
return;
}
int main(void){
cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
int t=1; //cin>>t;
while(t--) Main();
return 0;
} | //@Author: KeinYukiyoshi
// clang-format off
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#define int long long
using namespace std;
#define stoi stoll
#define fi first
#define se second
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; i++)
#define rep2(i, a, b) for (int i = (int)(a), i##_len=(b); i < i##_len; i++)
#define rep3(i, a, b) for (int i = (int)(a), i##_len=(b); i >= i##_len; i--)
#define FOR(i, a) for (auto &i: a)
#define ALL(obj) begin(obj), end(obj)
#define _max(x) *max_element(ALL(x))
#define _min(x) *min_element(ALL(x))
#define _sum(x) accumulate(ALL(x), 0LL)
const int MOD = 1000000007;
// const int MOD = 998244353;
const int INF = (int)(1e13 + 7);
const double EPS = 1e-8;
const double PI = 3.14159265358979;
template <class T> using V = vector<T>;
template <class T> using VV = vector<vector<T>>;
template <class T> using VVV = vector<vector<vector<T>>>;
template <class T, class S> using P = pair<T, S>;
template<class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}
template<class T> bool chmin(T &a, const T &b) {if (b < a) {a = b;return true;}return false;}
int _ceil(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }
int _mod(int a) {return a >= 0 ? a % MOD : a - (MOD * _ceil(a, MOD));}
int _pow(int a, int b) {int res = 1;for (a %= MOD; b; a = a * a % MOD, b >>= 1)if (b & 1) res = res * a % MOD;return res;}
struct mint {long long x;mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}mint operator-() const { return mint(-x); }mint &operator+=(const mint a) {if ((x += a.x) >= MOD) x -= MOD;return *this;}mint &operator-=(const mint a) {if ((x += MOD - a.x) >= MOD) x -= MOD;return *this;}mint &operator*=(const mint a) { (x *= a.x) %= MOD;return *this; }mint operator+(const mint a) const { return mint(*this) += a; }mint operator-(const mint a) const { return mint(*this) -= a; } mint operator*(const mint a) const { return mint(*this) *= a; }mint pow(long long t) const {if (!t) return 1;mint a = pow(t >> 1);a *= a;if (t & 1) a *= *this;return a;}mint inv() const { return pow(MOD - 2); }mint &operator/=(const mint a) { return *this *= a.inv(); }mint operator/(const mint a) const { return mint(*this) /= a; }};istream &operator>>(istream &is, mint &a) { return is >> a.x; }ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// clang-format on
class AABC {
public:
static void solve(istream &cin, ostream &cout) {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
int K;
cin >> K;
int ans = 0;
rep2(a, 1, K + 1) {
rep2(b, 1, _ceil(K, a) + 1) {
if (a * b <= K) {
ans += K / (a * b);
}
}
}
cout << ans << endl;
}
};
signed main() {
AABC solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll dp[100009][2];
vector<ll>vec;
ll M;
ll n;
ll call(ll pos,ll pev)
{
if(pos==0)
{
return 1;
}
if(dp[pos][pev]!=-1)
{
return dp[pos][pev];
}
ll x,y;
if(pev==0)
{
x=call(pos-1,0);
y=call(pos-1,1);
x=(x+y)%M;
}
else
{
x=call(pos-1,0);
x=x%M;
}
return dp[pos][pev]=x;
}
int main()
{
ll a,b,c,d,e,i,j,k,l,m,x,y,t,p;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a;
vec.push_back(a);
}
m=M=(1e9)+7;
memset(dp,-1,sizeof(dp));
for(i=n;i>=0;i--)
{
x=call(i,0);
x=call(i,1);
}
dp[0][0]=dp[0][1]=1;
if(n==1)
{
cout<<vec[0]<<endl;
return 0;
}
if(n==2)
{
x=(vec[0]*2);
cout<<x<<endl;
return 0;
}
ll ans=0;
x=(dp[n-1][0]*vec[0])%M;
ans=x;
for(i=1;i<n;i++)
{
a=dp[i-1][0];
b=dp[(n-1)-i][0];
//cout<<a<<" "<<b<<endl;
b=(a*b)%M;
b=(b*vec[i])%M;
a=dp[i-1][1];
c=dp[(n-1)-i][1];
//cout<<a<<" "<<c<<endl;
c=(c*a)%M;
c=(c*vec[i])%M;
b=(b-c)%M;
b=(b+M)%M;
ans=(ans+b)%M;
}
cout<<ans<<endl;
}
| /*
* Author - Abhas Jain
* Code is inside the solve function
*/
#include <bits/stdc++.h>
#define F first
#define S second
#define all(c) c.begin(), c.end()
#define endl '\n'
#define pb push_back
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
const ld PI = 3.141592653589793;
const ll INF = 9223372036854775807ll;
const ll mod = 1e9 + 7;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void solve()
{
int n;
cin >> n;
unordered_map<int, int, custom_hash> mp;
int mn = 1e9 + 2;
for (int i = 0; i < n; ++i) {
int cur;
cin >> cur;
mn = min(cur, mn);
for (int j = 1; j * j <= cur; ++j) {
if (cur % j == 0) {
mp[j] = __gcd(mp[j], cur);
mp[cur / j] = __gcd(mp[cur / j], cur);
}
}
}
int ans = 0;
for (auto div : mp) {
if (div.S == div.F && div.S <= mn) {
ans++;
}
}
cout << ans << endl;
}
int main( )
{
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> time(N);
vector<int> price(N);
vector<int> zaiko(N);
for(int i=0;i<N;i++){
cin >> time.at(i);
cin >> price.at(i);
cin >> zaiko.at(i);
}
bool b = false;
int min=1000000001;
for(int i=0;i<N;i++){
if(time.at(i)<zaiko.at(i)&&price.at(i)<min){
min=price.at(i);
b=true;
}
}
if(b==true){
cout << min << endl;
}
else{
cout << -1 << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
template<typename T, typename Y> inline void mint(T & x,Y y) {if(y < x) x = y;}
template<typename T, typename Y> inline void maxt(T & x,Y y) {if(y > x) x = y;}
#define si(x) static_cast<int>(x.size())
typedef int64_t ll;
constexpr int mod = (int) 1'000'000'007;
constexpr int maxn = (int) 2e5+5;
//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
auto solve() -> decltype(auto){
int n;
cin >> n;
using triplet = tuple<int,int,int>;
vector<triplet> A(n);
for(int i = 0;i < n;i++){
auto & [l,r,idx] = A[i];
idx = i;
cin >> l >> r;
}
auto x_compare = [](const triplet & _a,const triplet & _b){
return get<0>(_a) < get<0>(_b);
};
auto y_compare = [](const triplet & _a,const triplet & _b){
return get<1>(_a) < get<1>(_b);
};
vector<pair<int,int>> cands;
set<int> taken;
sort(A.begin(),A.end(),x_compare);
for(int i = 0;i < min(si(A),5);i++){
auto & [l,r,idx] = A[i];
cands.push_back({l,r});
taken.insert(idx);
}
for(int i = n-1;i >= max(0,si(A)-5);i--){
auto & [l,r,idx] = A[i];
if(taken.count(idx)) continue;
cands.push_back({l,r});
taken.insert(idx);
}
sort(A.begin(),A.end(),y_compare);
for(int i = 0;i < min(si(A),5);i++){
auto & [l,r,idx] = A[i];
if(taken.count(idx)) continue;
cands.push_back({l,r});
taken.insert(idx);
}
for(int i = n-1;i >= max(0,si(A)-5);i--){
auto & [l,r,idx] = A[i];
if(taken.count(idx)) continue;
cands.push_back({l,r});
taken.insert(idx);
}
vector<int> posib;
for(int i = 0;i < si(cands);i++){
for(int j = i+1;j < si(cands);j++){
posib.push_back(max(abs(cands[i].first-cands[j].first),abs(cands[i].second-cands[j].second)));
}
}
sort(posib.rbegin(),posib.rend());
cout << posib[1] << '\n';
}
int32_t main(void){
ios::sync_with_stdio(false);cin.tie(0);
uint32_t tcs = 1;
// cin >> tcs;
for(uint32_t i = 1;i <= tcs;i++) solve();
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define li long long
#define pii pair<int, int>
#define vi vector<int>
#define li long long
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define fore(i, b, e) for (int i = (int)b; i <= (int)e; i++)
const int MAXP = 18;
const int MAXN = 2e5 + 5;
vi edges[MAXN];
int jmp[MAXP + 1][MAXN];
int depth[MAXN];
vector<pii> order;
int n, k, root;
bool covered[MAXN];
int t;
int lcm(int u, int v) {
if (depth[u] > depth[v]) {
swap(u, v);
}
int delta = depth[v] - depth[u];
fore(j, 0, MAXP) {
if (delta & (1 << j)) {
v = jmp[j][v];
}
}
if (u == v) {
return v;
}
for (int level = MAXP; level >= 0; --level) {
int nextu = jmp[level][u];
int nextv = jmp[level][v];
if (nextu != nextv) {
u = nextu;
v = nextv;
}
}
assert(jmp[0][v] == jmp[0][u]);
return jmp[0][v];
}
int dist(int u, int v) {
int l = lcm(u, v);
return depth[u] - 2 * depth[l] + depth[v];
}
void paint(int v, int anc, int d) {
covered[v] = true;
if (d == t) {
return;
}
for (int u : edges[v]) {
if (u != anc) {
paint(u, v, d + 1);
}
}
}
bool check() {
memset(covered, false, sizeof(covered));
vi chosen;
for (auto p : order) {
int v = p.se;
/*bool covered = false;
for (int u : chosen) {
if (dist(v, u) <= t) {
covered = true;
break;
}
}*/
if (!covered[v]) {
if ((int)chosen.size() == k) {
return false;
}
int anc = v;
forn(j, MAXP + 1) {
if (t & (1 << j)) {
anc = jmp[j][anc];
}
}
if (anc <= 0) {
anc = root;
}
chosen.pb(anc);
paint(anc, -1, 0);
}
}
return true;
}
void dfs(int v, int anc) {
depth[v] = anc == -1 ? 0 : depth[anc] + 1;
jmp[0][v] = anc;
fore(level, 1, MAXP) {
jmp[level][v] = jmp[level - 1][jmp[level - 1][v]];
}
for (int u : edges[v]) {
if (u != anc) {
dfs(u, v);
}
}
}
int main() {
scanf("%d%d", &n, &k);
forn(i, n - 1) {
int u, v;
scanf("%d%d", &u, &v);
edges[u].pb(v);
edges[v].pb(u);
}
root = rand() % n + 1;
dfs(root, -1);
order.resize(n);
forn(j, n) {
order[j] = {depth[j + 1], j + 1};
}
sort(order.begin(), order.end());
reverse(order.begin(), order.end());
int start = 0;
int finish = order[0].fi;
while (start < finish) {
int middle = (start + finish) / 2;
t = middle;
if (check()) {
finish = middle;
} else {
start = middle + 1;
}
}
printf("%d", start);
} | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
//if(i==1)res = false;
if(n%i==0)res=false;
return res;
}
struct UnionFind{
ll N;
llvec p;
llvec cnt;
UnionFind(ll n){
N = n;
p=llvec(N);
cnt=llvec(N, 0);
rep(i, N){
p[i] = i;
cnt[i] = 1;
}
}
void con(ll a, ll b){
P at = root(a);
P bt = root(b);
if(at.second!=bt.second){
if(at.first>bt.first){
swap(at, bt);
swap(a, b);
}
p[at.second] = bt.second;
cnt[bt.second]+=cnt[at.second];
p[a]=bt.second;
}
}
P root(ll a){
ll atmp = a;
ll c=0;
while(atmp!=p[atmp]){
atmp = p[atmp];
c++;
}
p[a] = atmp;
return {c, atmp};
}
bool is_con(ll a, ll b){
P at=root(a);
P bt=root(b);
return at.second == bt.second;
}
};
/**************************************
** A main function starts from here **
***************************************/
int main(){
ll N;
cin >> N;
llvec x(N), y(N);
rep(i, N)cin >> x[i]>>y[i];
ld ok = 1e-10;
ld ng = 300;
while(abs(ok-ng)>1e-9){
ld r= (ok+ng)*0.5;
UnionFind uf(N+2);
for(ll i=0;i<N;i++){
for(ll j=i+1;j<N;j++){
if(sqrt(pow(x[i] - x[j], 2) + pow(y[i] - y[j], 2)) <2 * r){
uf.con(i, j);
}
}
if(abs(y[i]-100)<2*r)uf.con(N, i);
if(abs(y[i]+100)<2*r)uf.con(N+1, i);
}
if(uf.is_con(N, N+1)){
ng=r;
}else{
ok=r;
}
}
cout << setprecision(15)<<ok;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
using tp = tuple<ll, ll, ll>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
using Array = vector<ll>;
using Matrix = vector<Array>;
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
*/
template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<int mod>
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int) (1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using mint = ModInt<MOD>;
void solve() {
int n, m;
cin >> n >> m;
vec<ll> a(n);
REP(i, n) cin >> a[i];
int s = 0;
REP(i, n) {
s += a[i];
}
auto nCr = [](ll n, ll r) -> mint {
mint ret = 1;
REP(i, r) ret *= i + 1;
ret = ret.inverse();
REP(i, r) ret *= n - i;
return ret;
};
cout << nCr(m + n, s + n) << en;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*
ll t;
cin >> t;
REP(i, t - 1) {
solve();
}*/
solve();
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define MOD 1000000007
#define INF 1000000000
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b){//a^b
ll res=1;
a=a%MOD;
while(b>0){
if(b&1){res=(res*a)%MOD;b--;}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
ll fermat_inv(ll y){return power(y,MOD-2);}
ll gcd(ll a, ll b){return (b==0)?a:gcd(b,a%b);}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
//cin>>t;
while(t--){
ll r,c,m;
cin>>r>>c>>m;
vector <pair<ll,ll>> v;
vector <ll> x(c+1,r+1);
vector <ll> y(r+1,c+1);
for(int i=1;i<=m;i++){
ll x1,y1;
cin>>x1>>y1;
x[y1]=min(x[y1],x1);
y[x1]=min(y[x1],y1);
}
ll ans=0ll;
for(int i=1;i<=x[1]-1;i++)
ans+=y[i]-1ll;
for(ll i=1;i<=y[1]-1;i++){
v.push_back(make_pair(x[i]-1,i));
ans+=x[i]-1ll;
}
sort(v.begin(),v.end());
ordered_set s;
ll j=1;
for(int i=0;i<y[1]-1;i++){
while(j<=v[i].ff&&j<=x[1]-1){
ll val=1e6;
val*=y[j]-1ll;
val+=j;
s.insert(val);
j++;
}
v[i].ss*=(ll)1e6;
ll val=j-1-s.order_of_key(v[i].ss);
ans-=val;
}
cout<<ans<<"\n";
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i=0; i<N; i++) cin >> A[i];
vector<vector<long long> > mintable(N, vector<long long>(N, 100001));
for (int left=0; left<N; left++) {
for (int right=left; right<N; right++) {
if (right == left) {
mintable[left][right] = A[left];
continue;
}
mintable[left][right] = min(mintable[left][right-1], A[right]);
}
}
long long best = 0;
for (int left=0; left<N; left++) {
for (int right=left; right<N; right++) {
best = max(best, mintable[left][right] * (1+right-left));
}
}
cout << best << endl;
return 0;
} | #include <bits/stdc++.h>
#define psk push_back
#define ppk pop_back
#define mkp make_pair
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int u32;
typedef unsigned short u16;
typedef pair<int,int> PII;
typedef pair<LL,int> PLI;
typedef pair<int,LL> PIL;
typedef pair<LL,LL> PLL;
typedef map<int,int> MII;
typedef map<LL,int> MLI;
typedef map<int,LL> MIL;
typedef map<LL,LL> MLL;
typedef vector<int> VI;
typedef vector<PII > VII;
typedef vector<LL> VL;
typedef queue<int> QI;
typedef queue<PII > QII;
const short MSK15=0x7fff;
const u16 MSK16=0xffff;
const int MSK31=0x7fffffff;
const u32 MSK32=0xffffffff;
const LL MSK63=0x7fffffffffffffff;
const uLL MSK64=0xffffffffffffffff;
const int Inf=(1<<30)-1;
const int mInf1=0x3f3f3f3f;
const int mInf2=0x7f7f7f7f;
const LL lInf=(1LL<<62)-1;
const LL lmInf1=0x3f3f3f3f3f3f3f3fLL;
const LL lmInf2=0x7f7f7f7f7f7f7f7fLL;
const double dInf=1e15;
const double eps=1e-8;
u16 rnd16(){ return (u16)(rand())&MSK16; }
u32 rnd32(){ return (((u16)(rand())&MSK16)<<16)|(rand()&MSK16); }
uLL rnd64(){ return (((uLL)(rand())&MSK16)<<48)|(((LL)(rand())&MSK16)<<32)|(((u16)(rand())&MSK16)<<16)|(rand()&MSK16); }
short rnd15(){ return rand()&MSK15; }
int rnd31(){ return ((rand()&MSK15)<<16)|(rand()&MSK16); }
LL rnd63(){ return (((LL)(rand())&MSK15)<<48)|(((LL)(rand())&MSK16)<<32)|((u32)(rand()&MSK16<<16))|(rand()&MSK16); }
int rnd(){ return rnd31(); }
LL lrnd(){ return rnd63(); }
int a[10010];
int n;
LL check(int v)
{
int maxn=0,cur=0;
for(int i=1; i<=n+1; i++)
{
if(a[i]>=v) cur++;
else maxn=max(maxn,cur), cur=0;
}
// cout<<v<<" "<<maxn<<endl;
return 1LL*v*maxn;
}
int main()
{
ios::sync_with_stdio(false);
cin>>n;
for(int i=1; i<=n; i++) cin>>a[i];
LL maxn=0;
for(int i=1; i<=n; i++) maxn=max(maxn,check(a[i]));
cout<<maxn<<endl;
return 0;
}
|
#include<bits/stdc++.h>
#define lol long long
using namespace std;
int main(){
string s;
cin>>s;
for(int i=0;i<s.size();i++){
if(s[i]=='.'){
break;
}else{
cout<<s[i];
}
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
string x;
cin >> x;
int a = x.size();
rep(i, a){
if(x.at(i) == '.'){
x.erase(i);
break;
}
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
using namespace std;
const int nax = 4e5 + 11;
int a[nax];
int n;
bool cmp(int x, int y){
return a[x] < a[y];
}
int score[nax];
int pref[nax];
int OFFSET = 2e5 + 2;
vector<int> ziomki[nax];
char ans[nax];
void reku(int lo, int hi){
if(lo > hi) return;
if(score[lo] != score[hi]){
ans[lo] = '(';
ans[hi] = ')';
reku(lo + 1, hi - 1);
return;
}
int cur = pref[lo - 1];
int idx = pref[lo - 1] + OFFSET;
auto it = upper_bound(ziomki[idx].begin(), ziomki[idx].end(), lo - 1);
int nxt = (*it);
reku(lo, nxt);
reku(nxt + 1, hi);
}
void solve(){
cin >> n;
n *= 2;
for(int i=1;i<=n;i++) cin >> a[i];
vector<int> id;
for(int i=1;i<=n;i++) id.pb(i);
sort(id.begin(), id.end(), cmp);
//for(int x : id) cout<<x<<endl;
for(int i=1;i<=n/2;i++) score[id[i - 1]] = 1;
for(int i=n/2+1;i<=n;i++) score[id[i - 1]] = -1;
for(int i=1;i<=n;i++){
pref[i] = pref[i - 1] + score[i];
ziomki[pref[i] + OFFSET].pb(i);
}
reku(1, n);
for(int i=1;i<=n;i++) cout<<ans[i];
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int tt = 1;
// cin >> tt;
while(tt--) solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define sz(a) (ll)(a.size())
const int M = 1e5+5;
int a[M],b[M],f[M];
ll pref(int l, int r)
{
unordered_map<int, vector<int>> vec;
for(int i=l;i<=r;i++)
{
vec[a[i]-i].pb(i);
}
ll res = 0;
for(int i=r;i>=l;i--)
{
ll z;
if(sz(vec[b[i]-i]))
{
int id = vec[b[i]-i].back();
res += (ll)(i-id);
z = i-id;
}
else
{
cout<<"-1\n";
exit(0);
}
vec[a[i]-i].pop_back();
if(i != r and b[i]-i == b[i+1] - (i+1))
res-=z;
}
return res;
}
ll suff(int l, int r)
{
unordered_map<int, vector<int>> vec;
for(int i=r;i>=l;i--)
{
vec[a[i]-i].pb(i);
}
ll res = 0;
for(int i=l;i<=r;i++)
{
ll z;
if(sz(vec[b[i]-i]))
{
int id = vec[b[i]-i].back();
res += (ll)(id-i);
z = id - i;
}
else
{
cout<<"-1\n";
exit(0);
}
vec[a[i]-i].pop_back();
if(i != l and b[i]-i == b[i-1] - (i-1))
res-=z;
}
return res;
}
ll solve(int l, int r)
{
for(int j=l+1;j<=r;j++)
{
if(f[j] != -1)
{
return pref(l,j-1)+suff(j, r);
}
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, L;
cin>>n>>L;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
cin>>b[i];
a[0] = 0;
a[n+1] = L+1;
b[n+1] = L+1;
for(int i=0;i<=n+1;i++)
{
if(a[i] > b[i])
f[i] = -1;
if(a[i] < b[i])
f[i] = 1;
}
for(int i=1;i<=n+1;i++)
{
if(f[i-1] == 1 and f[i] == -1)
{
// cout<<i<<endl;
cout<<"-1\n";
return 0;
}
}
int l = 0;
ll ans = 0;
for(int i=1;i<=n+1;i++)
{
if(f[i] == 0)
{
ans += solve(l, i);
l = i;
}
}
cout<<ans<<"\n";
return 0;
} |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
int MOD = 1000000007;
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << 7 * 3 - (a + b + c) << endl;
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
vector<int>vc(3);
cin>>vc[0];
cin>>vc[1];
cin>>vc[2];
sort(vc.begin(),vc.end());
if(vc[2]-vc[1]==vc[1]-vc[0])
{
cout<<"Yes";
}
else
cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pai arccos(-1);
#define keta(n) cout << fixed << setprecision((n));
using ll = long long;
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#define Sort(a) sort(a.begin(), a.end())
#define Reverse(a) reverse(a.begin(), a, end())
typedef long long int ll;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<vector<ll>> vvll;
typedef long double ld;
const int INF = 1 << 30;
const ll MOD = 1000000007;
int main(){
string s;
cin>>s;
int count=0;
for(int i=0;i<s.size();i++){
if(s[i]=='Z'&&s[i+1]=='O'&&s[i+2]=='N'&&s[i+3]=='e'){
count++;
}
}
cout << count << endl;
}
| // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/********************************************************************/
#define M1 1000000007
#define M2 998244353
const double pi = 3.14159265;
#define ll long long
#define lld long double
#define pb push_back
#define mp make_pair
#define vi vector<ll>
#define endl '\n'
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define collect(v, n) \
for (ll i = 0; i < n; i++) { \
cin >> v[i]; \
}
#define prv(v) \
for (auto x : v) cout << x << " "; \
cout << endl;
#define prmap(v) \
for (auto x : v) cout << x.first << " " << x.second << endl;
#define prpair(x) cout << x.first << " " << x.second << endl;
/*
__builtin_popcount(n) // the number of ones in the int
__builtin_popcountll(n) // the number of ones in the ll
__builtin_parity(n) // the parity (even or odd) of the number of ones
__builtin_clz(n) // the number of zeros at the beginning of the number
__builtin_clzll(n) // the number of zeros at the beginning of the ll
__builtin_ctz(n) // the number of zeros at the end of the number
*/
// template <typename T>
// #define o_set(T) \
// tree<T, null_type, less_equal<T>, rb_tree_tag, \
// tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
// MULTISET ==> less_equal
// SET ==> less
ll powM(ll x, ll y, ll m) {
ll ans = 1, r = 1;
x %= m;
while (r > 0 && r <= y) {
if (r & y) {
ans *= x;
ans %= m;
}
r <<= 1;
x *= x;
x %= m;
}
return ans;
}
int add(int a, int b) {
a += b;
if (a >= M2) a -= M2;
return a;
}
int mul(int a, int b) { return a * 1ll * b % M2; }
int binpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = mul(res, a);
a = mul(a, a);
b >>= 1;
}
return res;
}
map<long long, long long> factorize(long long n) {
map<long long, long long> ans;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
ans[i]++;
n /= i;
}
}
if (n > 1) {
ans[n]++;
n = 1;
}
return ans;
}
ll countBits(ll n) {
ll count = 0;
while (n) {
count++;
n >>= 1;
}
return count;
}
ll isP(ll n) {
if (n == 0 || n == 1) return 0;
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0) return 0;
}
return 1;
}
ll min(ll a, ll b) {
if (a < b) return a;
return b;
}
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd((ll)y % x, (ll)x);
}
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;
}
/* **********END OF TEMPLATE*********** */
void solve() {
string s;
cin >> s;
ll ans = 0;
ll n = s.size();
for (ll i = 0; i + 3 < n; i++) {
ans += (s[i] == 'Z' && s[i + 1] == 'O' && s[i + 2] == 'N' &&
s[i + 3] == 'e');
}
cout<<ans<<endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << setprecision(12);
ll tt = 1;
// cin >> tt;
for (ll tc = 1; tc <= tt; tc++) {
// cout << "Case #" << tc << ": ";
solve();
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define oss ostringstream
#define db double
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repn(i,a,b) for(ll i=a;i>=b;i--)
#define F first
#define S second
#define qi queue<ll>
#define pii pair<ll,ll>
#define vi vector<ll>
#define si set<ll>
#define vii vector<pii>
#define mi multiset<ll>
#define mii multiset<pii>
#define MI map<ll,ll>
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define vin(a,n) vi a(n); rep(k,0,n) {cin>>a[k];}
#define vout(a) rep(k,0,a.size()) {cout<<a[k]<<" ";} cout<<"\n";
#define all(v) (v).begin(), (v).end()
#define allr(v) (v).rbegin(), (v).rend()
#define mod 998244353
#define mod2 998244353
#define inf LLONG_MAX
const ll N=1e9+7;
ll fexp(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 a, ll p){return fexp(a, p-2);}
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll l;
cin>>l;
rep(i,0,l){
ll n;
cin>>n;
if(n&1) cout<<"Odd\n";
else{
if((n/2)&1)cout<<"Same\n";
else cout<<"Even\n";
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll test_case=1; //cin>>test_case;
while(test_case--)
{
// cout << "Case #" << i << ": ";
ll x;
cin>>x;
if(x%100==0)
{
cout<<100<<"\n";
continue;
}
ll yy=x/100;
yy++;
cout<<100*yy-x<<"\n";
//Case_Ends_Here :)
}
}
|
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iterator>
#include <cmath>
#include <set>
#include <deque>
#include <string>
using namespace std;
struct Request {
int s;
int t;
int p;
};
struct Point {
int time;
long long cost;
int upOrDown; //1--up, -1--down
bool operator < (const Point &a) const {
return this->time>a.time;//最小值优先
}
};
int n;
int w;
Request r[200010];
int main()
{
std::priority_queue<Point> q;
scanf("%d%d", &n, &w);
for (int i = 0 ; i < n ; i++) {
scanf("%d%d%d", &(r[i].s), &(r[i].t), &(r[i].p));
Point ptA;
ptA.time = r[i].s;
ptA.cost = r[i].p;
ptA.upOrDown = 1;
q.push(ptA);
ptA.time = r[i].t;
ptA.cost = r[i].p;
ptA.upOrDown = -1;
q.push(ptA);
}
long long curCost = 0;
while (q.empty() == false) {
Point curP = q.top();
q.pop();
int curTime = curP.time;
if (curP.upOrDown == 1) {
curCost = curCost + curP.cost;
} else {
curCost = curCost - curP.cost;
}
if (q.empty())
break;
curP = q.top();
while (curP.time == curTime) {
if (curP.upOrDown == 1) {
curCost = curCost + curP.cost;
} else {
curCost = curCost - curP.cost;
}
q.pop();
if (q.empty())
break;
curP = q.top();
}
if (curCost > w) {
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <set>
#include <string>
#include <vector>
struct Row
{
long start;
long end;
long p;
bool operator<(const Row& rhs) const
{
return end < rhs.end;
}
};
std::string solve(long n, long w, std::vector<Row>& rows)
{
std::sort(rows.begin(), rows.end(),
[](const Row& lhs, const Row& rhs) { return lhs.start < rhs.start; });
long sum = 0;
std::multiset<Row> olds;
for (auto& r : rows) {
sum += r.p;
for (auto it = olds.begin(); it != olds.end(); ++it) {
if (it->end <= r.start) {
sum -= it->p;
} else {
olds.erase(olds.begin(), it);
break;
}
}
if (sum > w) return "No";
olds.insert(r);
}
return "Yes";
}
int main()
{
long n, w;
std::cin >> n >> w;
std::vector<Row> rows(n);
for (auto& r : rows) {
std::cin >> r.start >> r.end >> r.p;
}
std::cout << std::setprecision(20);
std::cout << solve(n, w, rows) << std::endl;
}
|
//#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <complex>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define itn int
#define nit int
#define ll long long
#define ms multiset
#define F(i,a,b) for(register int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(register int i=a,i##end=b;i>=i##end;--i)
#define re register
#define ri re int
#define il inline
#define pii pair<int,int>
#define cp complex<double>
//#pra gma G CC opti mize(3)
using namespace std;
using std::bitset;
//using namespace __gnu_pbds;
const double Pi=acos(-1);
namespace fastIO {
template<class T>
inline void read(T &x) {
x=0;
bool fu=0;
char ch=0;
while(ch>'9'||ch<'0') {
ch=getchar();
if(ch=='-')fu=1;
}
while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
if(fu)x=-x;
}
inline int read() {
int x=0;
bool fu=0;
char ch=0;
while(ch>'9'||ch<'0') {
ch=getchar();
if(ch=='-')fu=1;
}
while(ch<='9'&&ch>='0') x=(x*10-48+ch),ch=getchar();
return fu?-x:x;
}
char _n_u_m_[40];
template<class T>
inline void write(T x ) {
if(x==0){
putchar('0');
return;
}
T tmp = x > 0 ? x : -x ;
if( x < 0 ) putchar('-') ;
register int cnt = 0 ;
while( tmp > 0 ) {
_n_u_m_[ cnt ++ ] = tmp % 10 + '0' ;
tmp /= 10 ;
}
while( cnt > 0 ) putchar(_n_u_m_[ -- cnt ]) ;
}
template<class T>
inline void write(T x ,char ch) {
write(x);
putchar(ch);
}
}
using namespace fastIO;
ll n,m,k;
const long long mod=998244353;
inline long long pw(long long x,long long p)
{
long long res=1;
for(;p;p>>=1,x=x*x%mod)
if(p&1)res=res*x%mod;
return res;
}
inline long long getm(long long top,long long bot) {
return (top*pw(bot,mod-2))%mod;
}
ll ans;
int main() {
read(n);read(m);read(k);
if(n>1&&m>1){
F(i,1,k){
ans+=(pw(i,n)-pw(i-1,n)+mod)*pw(k-i+1,m);
ans%=mod;
}write(ans);
}
else{
if(n<m)swap(n,m);
write(pw(k,n));
}
return 0;
}
| #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const { return {l_}; }
I end() const { return {r_}; }
};
struct Per {
struct I {
int i;
void operator++() { --i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i > *o; }
};
const int l_, r_;
Per(int l, int r) : l_(l), r_(r) {}
Per(int n) : Per(0, n) {}
I begin() const { return {r_ - 1}; }
I end() const { return {l_ - 1}; }
};
template <class F>
struct Fix : private F {
Fix(F f) : F(f) {}
template <class... Args>
decltype(auto) operator()(Args&&... args) const {
return F::operator()(*this, std::forward<Args>(args)...);
}
};
template <class T = int>
T scan() {
T res;
std::cin >> res;
return res;
}
template <class T, class U = T>
bool chmin(T& a, U&& b) {
return b < a ? a = std::forward<U>(b), true : false;
}
template <class T, class U = T>
bool chmax(T& a, U&& b) {
return a < b ? a = std::forward<U>(b), true : false;
}
#ifndef LOCAL
#define DUMP(...) void(0)
template <int OnlineJudge, int Local>
constexpr int OjLocal = OnlineJudge;
#endif
using namespace std;
#define ALL(c) begin(c), end(c)
#pragma endregion
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cout << fixed << setprecision(20);
int n = scan();
auto s = scan<string>();
vector<int> x(n + 1);
generate(ALL(x), scan<>);
vector<int> buf(n + 1);
auto check = [&](int k) -> bool {
for (int z : Rep(k)) {
for (int i : Rep(n + 1)) buf[i] = x[i] / k + (z < x[i] % k);
for (int i : Rep(n)) {
if (s[i] == '<' and not(buf[i] < buf[i + 1])) return false;
if (s[i] == '>' and not(buf[i] > buf[i + 1])) return false;
}
}
return true;
};
int ok = 1, ng = 10001;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
(check(mid) ? ok : ng) = mid;
}
cout << ok << '\n';
for (int z : Rep(ok))
for (int i : Rep(n + 1))
cout << x[i] / ok + (z < x[i] % ok) << " \n"[i == n];
}
|
/*/
Author: Chaitanya_1999
"Everything in this world is magic, except to the magician"
/*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for(int i =0 ;i <n;i++)
#define fn1 for( int i =1;i<=n; i++)
#define fm for(int j =0 ;j <m;j++)
#define fm1 for(int j =1;j<=m;j++)
#define fi first
#define se second
#define endl '\n'
#define PI 3.14159265358979323846
#define MOD 1000000007
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
const int N = 2e6+5;
const int INF = 1e18L;
// for all eight directions
int dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
// for all 4 directions
//int dx[4]={-1,1,0,0};
//int dy[4]={0,0,-1,1};
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
/*/-----------------------------Debug begins----------------------------------/*/
vector<string> split(const string& s, char c) {
vector<string> v; stringstream ss(s); string x;
while (getline(ss, x, c)) v.emplace_back(x); return move(v);
}
template<typename T, typename... Args>
inline string arrStr(T arr, int n) {
stringstream s; s << "[";
for(int i = 0; i < n - 1; i++) s << arr[i] << ",";
if(n>0)
s << arr[n - 1] ;
s<< "]";
return s.str();
}
#define trace(args...) {__trace_begin(__LINE__); __trace(split(#args, ',').begin(), args);}
inline void __trace_begin(int line) { cerr << "#" << line << ": "; }
template<typename T> inline void __trace_out_var(vector<T> val) { cerr << arrStr(val, val.size()); }
template<typename T> inline void __trace_out_var(T* val) { cerr << arrStr(val, 10); }
template<typename T> inline void __trace_out_var(T val) { cerr << val; }
inline void __trace(vector<string>::iterator it) { cerr << endl; }
template<typename T, typename... Args>
inline void __trace(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
__trace_out_var(a);
cerr << "; ";
__trace(++it, args...);
}
/*/-----------------------------Code begins----------------------------------/*/
int ar[N];
int dp[N];
signed main(){
IOS;
int T=1;
// cin >> T;
vector<int>tw;
tw.pb(1);
while(tw.back()<1e18L){
tw.pb(tw.back()*2ll);
}
while(T--){
int n;
cin >> n ;
int ans = INF;
int k = 0;
for(auto i : tw){
int rem = n%i;
int q = n/i;
ans=min(ans,rem+q+k);
k++;
}
assert(ans!=INF);
cout << ans;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<": "<<(x)<<endl
using namespace std;
using llong = long long;
using vi = vector<int>;
using vvi = vector<vi >;
using vvvi = vector<vvi >;
using pii = pair<int,int>;
constexpr int INF = 1e9;
constexpr llong LINF = 1e18;
constexpr double EPS = 1e-12;
constexpr int MOD = 1e9+7;
template<class Type>
void line(const Type &a){int cnt=0;for(const auto &elem:a)cerr<<(cnt++?' ':'>')<<elem;cerr<<endl;}
template<class Type> inline bool chmax(Type &a,const Type &b){if(a<b){a=b;return true;}return false;}
template<class Type> inline bool chmin(Type &a,const Type &b){if(a>b){a=b;return true;}return false;}
int main(){//I refer to other commentaries.
int n;
cin>>n;
llong low=-LINF, high=LINF, add=0;
REP(i,n){
llong a;
int t;
cin>>a>>t;
if(t==1){
low+=a;
high+=a;
add+=a;
}else if(t==2){
chmax(low,a);
chmax(high,a);
}else{
chmin(low,a);
chmin(high,a);
}
}
int q;
cin>>q;
while(q--){
llong x;
cin>>x;
cout<<min(high,max(low,x+add))<<endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0};
long double eps = 1e-9;
long double pi = acos(-1);
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll n,k;
cin>>n>>k;
ll cnt[n]={};
for(int i=0;i<n;i++){
ll a;
cin>>a;
cnt[a]++;
}
ll ans = 0;
ll now = min(k,cnt[0]);
ans += now;
for(int i=1;i<n;i++){
ans += min(now,cnt[i]);
chmin(now,cnt[i]);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
inline void debug_print() { cerr << endl; }
template <typename T1, typename... T2> void debug_print(const T1 a, const T2 &... b) { cerr << a << ' '; debug_print(b...); }
#define debug(...) cerr << __LINE__ << ": [" << #__VA_ARGS__ << "] = " , debug_print(__VA_ARGS__);
#else
#define debug(...) true
#endif
inline void print() { cout << '\n'; }
template <typename T1, typename... T2> void print(const T1 a, const T2 &... b) { cout << a << ' '; print(b...); }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto e : v) os << e << ' '; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) { for (auto e : v) os << e << ' '; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) { for (auto e : v) os << e << ' '; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp) { for (auto e : mp) os << e << ' '; return os; }
template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } else return false; }
template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } else return false; }
//-------------------------- Libraries --------------------------//
//---------------------------- Solve ----------------------------//
void solve() {
int N, K; cin >> N >> K;
vector<int> cnt(N+1);
for (int i = 0; i < N; i++) {
int a; cin >> a;
cnt[a]++;
}
long long ans = 0, tmp = K;
for (int i = 0; i <= N; i++) {
if (cnt[i] >= tmp) continue;
ans += (long long)(tmp - cnt[i]) * i;
tmp = cnt[i];
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int t = 1;
//cin >> t;
while (t--) solve();
return 0;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
inline int read () {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') t = -1, c = getchar();
while (c >= '0' && c <= '9') ret = ret * 10 + c - '0', c = getchar();
return ret * t;
}
const int MAXN = 200200;
int n, fa[MAXN][22]; vector <int> E[MAXN];
int dep[MAXN], wson[MAXN];
void dfs (int x, int f) {
dep[x] = dep[f] + 1; fa[x][0] = f;
for (auto i: E[x]) if (i != f) dfs(i, x);
}
int dis (int u, int v) {
int ret = dep[u] + dep[v], i;
if (dep[u] < dep[v]) swap(u, v);
for (i = 20; i >= 0; i--) if (dep[fa[u][i]] >= dep[v]) u = fa[u][i];
if (u == v) return ret - 2 * dep[u];
for (i = 20; i >= 0; i--) if (fa[u][i] != fa[v][i]) u = fa[u][i], v = fa[v][i];
u = fa[u][0]; return ret - 2 * dep[u];
}
int las = 0, ans[MAXN];
void calc (int x, int f) {
ans[x] = ans[las] + dis(las, x); las = x;
for (auto i: E[x]) if (i != f && i != wson[x]) calc(i, x);
if (wson[x]) calc(wson[x], x);
}
int main () {
n = read(); int i, j;
for (i = 1; i < n; i++) {
int u = read(), v = read();
E[u].push_back(v), E[v].push_back(u);
}
dfs(1, 0);
for (i = 1, j = 0; i <= n; i++) if (dep[j] < dep[i]) j = i;
int rt = j; dfs(j, 0);
for (i = 1, j = 0; i <= n; i++) if (dep[j] < dep[i]) j = i;
for (i = j; i; i = fa[i][0]) wson[fa[i][0]] = i;
for (i = 1; i <= 20; i++) for (j = 1; j <= n; j++) fa[j][i] = fa[fa[j][i - 1]][i - 1];
calc(rt, 0);
for (i = 1; i <= n; i++) printf("%d ", ans[i]);
return 0;
} |
// in case of multiple test cases and N=1e5 don't intialize arrays as global except for graph vector-array
// always check whether or not you are doing mod of a negative number
// always use 1LL instead of 1
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
// using long doubles saves you from corner cases but is very time consuming
#define double long double
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define all(a) (a).begin(),(a).end()
#define sz(x) (int)x.size()
// just comment the line below in case of interactive problems
#define endl "\n"
#define repp(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define brep(i,a,b) for(int i=a;i>=b;i--)
#define deb1(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define trace(v) for(auto it=v.begin();it!=v.end();it++)cout<<*it<<" ";cout<<endl;
#define tracearr(a,l,r) for(int iii=l;iii<=r;iii++)cout << a[iii] << " ";cout << endl;
#define PI 3.1415926535897932384626
#define F first
#define S second
#define mod 1000000007
#define clr(x,y) memset(x, y, sizeof(x))
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define inp(arr, n) repp(i, 0, n) cin >> arr[i]
#define outp(arr, n) repp(i, 0, n) cout << arr[i] << " "
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
// *s.find_by_order(1) - gives the 2nd samllest element in set
// s.order_of_key(x) - gives the number of elements in the set which are strictly smaller than x
void solve()
{
int n; cin >> n;
int ans = 0;
vector<pair<int, int> > points;
while (n--) {
int x, y;
cin >> x >> y;
points.pb({x, y});
}
int flag = 0;
repp(i, 0, sz(points)){
repp(j, 0, sz(points)){
repp(k, 0, sz(points)){
if(i != j and j != k and i != k){
int a = points[i].F * (points[j].S - points[k].S) + points[j].F * (points[k].S - points[i].S) + points[k].F * (points[i].S - points[j].S);
if(a == 0){
flag = 1;
break;
}
}
}
}
}
cout << (flag ? "Yes" : "No");
}
int32_t main()
{
IOS;
int T = 1;
// cin >> T;
//sieve();
// int numOfSetBits = __builtin_popcountll(n);
//std::cout << std::fixed << std::setprecision(12);
for (int i = 1; i <= T; i++)
{
//cout << "Case #" << i << ": ";
solve();
}
} |
//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<n;++i)
#define mod (ll)(1e9+7)
#define FIX(a) ((a)%mod+mod)%mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define fi first
#define se second
#define pb push_back
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
ll h,w,a,b;
ll hmax = 16;
ll wmax = 16;
vvll use(hmax+1,vll(wmax+1,0));
ll solve(ll now, ll cnt){
//cout << now << endl;
ll ni = now/w;
ll nj = now%w;
ll ret = 0;
if(cnt==a) return 1;
if(now==h*w) return 0;
if(use[ni][nj]==1){
ret += solve(now+1,cnt);
}else{
if(nj+1<w&&use[ni][nj+1]==0){
use[ni][nj]=1;
use[ni][nj+1]=1;
ret += solve(now+1,cnt+1);
use[ni][nj]=0;
use[ni][nj+1]=0;
}
if(ni+1<h){
use[ni][nj]=1;
use[ni+1][nj]=1;
ret += solve(now+1,cnt+1);
use[ni][nj]=0;
use[ni+1][nj]=0;
}
ret += solve(now+1,cnt);
}
return ret;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w >> a >> b;
ll ans = solve(0,0);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define fi first
#define se second
#define pb push_back
#define mod(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,a,b) for(int i = a; i < b; i++)
#define forr(i,a,b) for(int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const ll mod = 1e9+7;
int sum(int a, int b){return (a+b) % mod;}
int sub(int a, int b){return (a + mod - b) % mod;}
int mul(int a, int b){return (1ll * a * b) % mod;}
int power(int a,int b){
int res = 1;
while(b){
if(b&1)res = mul(res,a);
b >>= 1;
a = mul(a,a);
}
return res;
}
const ll oo = (ll)1e18;
bool esPrimo(int x){
forn(i,2,x)if(x%i == 0)return false;
return true;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
vi primos;
forn(i,2,51){
if(esPrimo(i))primos.pb(i);
}
debug(primos);
int N; cin >> N;
vi A(N);
forn(i,0,N)cin >> A[i];
ll res = oo;
forn(mask,0,(1<<primos.size())){
ll act = 1;
forn(bit,0,(int)primos.size()){
if(mask&(1<<bit)){
act *= ll(primos[bit]);
}
}
bool can = true;
forn(i,0,N){
if(__gcd(ll(A[i]),act) == 1){
can = false;
break;
}
}
if(can){
res = min(res,act);
}
}
cout << res << '\n';
return 0;
}
/*
__builtin_mul_overflow(x,y,&x)
-fsplit-stack
*/
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector <string> s(n);
rep(i, n){
cin >> s[i];
}
ll a = 1, b = 0;
reverse(s.begin(), s.end());
rep(i, n){
if(s[i] == "AND"){
a += b;
b *= 2;
}
else{
b += a;
a *= 2;
}
}
if(s[n - 1] == "AND"){
cout << a + b << endl;
}
else{
cout << a + b << endl;
}
}
| /*
Author : Chandan Agrawal
College : Poornima College of Engg. jaipur, Raj
Mail : [email protected]
" when you are not practicing someone else is ,
and the day u meet them u will lose "
*/
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define MAX 100050
#define ll long long
#define ld long double
#define lli long long int
#define pb push_back
#define INF 1000000000000
#define mod 1000000007
// trignometric function always give value in Radians only
#define PI acos(-1) //3.1415926535897932384626433832795028
#define dsin(degree) sin(degree*(PI/180.0))
#define dcos(degree) cos(degree*(PI/180.0))
#define dtan(degree) tan(degree*(PI/180.0))
#define rsin(radian) sin(radian)
#define rcos(radian) cos(radian)
#define rtan(radian) tan(radian)
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define memf(a) memset(a,false,sizeof(a))
#define loop(i,n) for (lli i = 0; i < n; i++)
#define FOR(i,a,b) for (lli i = a; i < b; i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define makeuniq(v) v.resize(unique(all(v)) - v.begin()); //only uniq element in vector after this
#define sz(x) int(x.size())
#define F first
#define S second
#define mii map<lli,lli>
#define pii pair<lli,lli>
#define vi vector<lli>
#define vvi vector<vi>
#define vpi vector<pii>
#define vbool vector<bool>
#define seti set<lli>
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (a/gcd(a,b))*b
#define abs(x) ((x < 0)?-(x):x)
#define endl '\n'
template <typename Head>
void print(Head&& head)
{
cout<<head<<endl;
}
template <typename Head, typename... Tail>
void print(Head&& head, Tail... tail)
{
cout<<head<<" ";
print(tail...);
}
#define scanarr(a,n) for(lli i=0;i<n;i++) cin>>a[i];
#define scanvec(a,n) for(lli i=0;i<n;i++){ lli x ; cin>>x; a.pb(x);}
#define printarr(a,n) for(lli i=0;i<n;i++) cout<<a[i]<<" "; cout<<endl;
#define printvec(vec) for(auto xt : vec) cout<<xt<<" "; cout<<"\n";
#define FD(N) fixed<<setprecision(N)
#define deb(x) cout<<#x<<" "<<x<<endl;
/*
1D vector - vi dp(n,value);
2D vector - vvi dp(n,vi(n,value));
*/
// chandan1,2
void chandan1(){int y=1;return;}
void chandan2(){
loop(i,10){
lli x=1;
}
return(chandan1());
}
int main(){
fastio
lli t=1;
//cin>>t;
chandan2();
while(t--) {
lli n;
cin>>n;
print(max(0LL,n));
}
return 0;
} |
#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-10
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
vector<string> c;
int main(){
int n;cin>>n;
cout<<((1<<n)-1)<<endl;
string s="AB";
c.push_back(s);
for(int i=2;i<=n;i++){
vector<string> d;
for(auto j:c){
d.push_back(j+j);
string p="";
for(int k=0;k<j.length();k++){
if(j[k]=='A') p+='B';
else p+='A';
}
d.push_back(j+p);
}
string t="";
for(int k=1;k<=(1<<(i-1));k++){
t+='A';
}
for(int k=1;k<=(1<<(i-1));k++){
t+='B';
}
d.push_back(t);
c=d;
}
for(auto i:c){
cout<<i<<endl;
}
} | //#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
#define eps 1e-8
//#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int>pii;
const int mod= 998244353;
long double pi = acosl(-1);
const ll infl = 8e18+5;
const int inf = 1e9+2;
const int nmax = 5e3+5;
//const int MAXLG = log2(nmax)+1;
//mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//typedef tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ost;
int main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n;
cin>>n;
vector<string>ans;
for(int i=1; i<(1<<n); i++){
string s;
for(int j=1; j<=(1<<n); j++){
if( __builtin_popcount(i&j)&1 ) s+='A';
else s+='B';
}
ans.push_back(s);
}
cout<<ans.size()<<"\n";
for(auto z : ans) cout<<z<<"\n";
}
/*
*/
|
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define forn(i,a,b) for(i=a;i<b;i++)
#define rfor(i,a,b) for(i=b-1;i>=a;i++) // reverse loop
#define yes "YES"
#define no "NO"
#define sorta(a) sort(a.begin(),a.end())
#define rsort(a) sort(a.rbegin(),a.rend()) // reverse sort
#define all(a) a.begin(),a.end()
using namespace std;
//const unsigned int mod = 1000000007;
vector<ll>prime(10000001,1);
vector<ll>sdf(1000001,1);
long long inf=1000000000000000007;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll n,x,i;
cin>>n>>x;
x=x*100;
vector<ll >a(n),p(n);
for(i=0;i<n;i++)
{
cin>>a[i]>>p[i];
}
long double ans=0;int f=0;
for(i=0;i<n;i++)
{
ans+=(a[i]*p[i]);
//cout<<ans<<endl;
if(ans>x)
{f=1;break;}
}
if(f==1)
cout<<(i+1)<<endl;
else
cout<<-1<<endl;
}
| /*
* Author: Moon_light
* Solution:
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x) freopen(x,'w',stdout)
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define bitcnt(x) (__builtin_popcountll(x))
#define rep(i,a,b) for(int i = (a);i<=(b); ++i)
#define per(i,a,b) for(int i = (a);i>=(b); --i)
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<double,double> PDD;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<double> VB;
typedef double db;
//global variable
const int N = 1;
const int mod = 1e9+7;
int t;
//functions
LL qmi(LL a,LL k,LL mod){
LL res = 1;
while(k){
if(k&1) res = res*a%mod;
k >>= 1;
a = a*a%mod;
}
return res%mod;
}
int gcd(int a,int b) {
return b==0? a:gcd(b,a%b);
}
//code from here! Come on! Have a pleasant experience~
int main()
{
IO;
int a,b;
cin>>a>>b;
int c = a+b;
int ans = 4;
if(c >= 15 && b >= 8){
ans = 1;
}else if(c >= 10 && b >= 3){
ans = 2;
}else if(c >= 3){
ans = 3;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int x, y; cin >> x >> y;
cout << (abs(x-y) < 3 ? "Yes" : "No");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<vi> vii;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define loop(n) for(int i=0; i<n; i++)
#define rep(i, a, n) for(int i=a; i<n; i++)
#define file_read freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout);
#define tc int t; cin>>t; while(t--)
#define endl "\n"
#define usainbolt cin.tie(0) -> sync_with_stdio(0)
int main(void){
usainbolt;
//file_read
int x, y;
cin>>x>>y;
int ans = abs(x-y);
if(ans < 3){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} |
#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(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
int main(){
ll a, b, k; cin >> a >> b >> k;
ll comb[61][61];
comb[0][0]=1;
for(int i=1;i<=60;i++){
REP(j,i+1){
if(j==0)
comb[i][j]=comb[i-1][j];
else
comb[i][j]=comb[i-1][j-1]+comb[i-1][j];
}
}
string ans="";
int n=a+b;
REP(i,n){
if(a==0||b==0){
if(a==0)
ans+='b';
else
ans+='a';
}
else{
ll c=comb[a+b-1][a-1];
if(k-c<=0){
ans+='a';
a--;
}
else{
k-=c;
ans+='b';
b--;
}
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi acos(-1)
#define int long long
#define fastttt std::ios::sync_with_stdio(false);std::cin.tie(NULL);std::cout.tie(NULL);
#define endl "\n"
long long pow2(long long a,long long b,long long m){
long long ans=1;
while(b>0){
if(b&1){ans=(ans*a)%m;}
a=(a*a)%m;
b>>=1;
}
return ans;
}
long long pow2(long long a,long long b){
long long ans=1;
while(b>0){
if(b&1){ans=(ans*a);}
a=(a*a);
b>>=1;
}
return ans;
}
int ncr(int n, int r)
{
long long p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0) {
while (r) {
p *= n;
k *= r;
long long m = __gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else
p = 1;
return p;
}
string call(int a,int b,int k,int i,int cur){
if(i == 0)return "";
if(a == 0){
string ret(i,'b');
return ret;
}
if(b == 0){
string ret(i,'a');
return ret;
}
int up = ncr(a+b-1,b);
if(up+cur-1 < k){
return "b"+call(a,b-1,k,i-1,cur+up);
}
else{
if(a)
return "a"+call(a-1,b,k,i-1,cur);
else return "b"+call(a,b-1,k,i-1,cur);
}
}
void solve(){
int a,b,k;
cin>>a>>b>>k;
cout<<call(a,b,k,a+b,1);
}
int32_t main()
{
fastttt
int t = 1;
// cin>>t;
while(t--)
{
solve();
}
return 0;
} |
#include <bits/stdc++.h>
#define N 200005
using namespace std;
using ll = long long;
struct point { ll x, y; };
struct matrix {
ll mat[3][3];
matrix operator*(matrix rhs) {
matrix res;
for (int i=0; i<3; i++) {
for (int j=0; j<3; j++) {
res.mat[i][j] = 0;
for (int k=0; k<3; k++) {
res.mat[i][j] += mat[i][k] * rhs.mat[k][j];
}
}
}
return res;
}
point operator*(point p) {
return {
mat[0][0]*p.x + mat[0][1]*p.y + mat[0][2],
mat[1][0]*p.x + mat[1][1]*p.y + mat[1][2],
};
}
void print() {
for (int i=0; i<3; i++) {
for (int j=0; j<3; j++) cout<<mat[i][j]<<' ';
cout<<endl;
}
cout<<endl;
}
};
matrix rot_cw() { return {0,1,0, -1,0,0, 0,0,1}; }
matrix rot_ccw() { return {0,-1,0, 1,0,0, 0,0,1}; }
matrix ref_x(ll k) { return {-1,0,2*k, 0,1,0, 0,0,1}; }
matrix ref_y(ll k) { return {1,0,0, 0,-1,2*k, 0,0,1}; }
int n, m, q;
point ps[N];
matrix pre[N];
int main() {
cin>>n;
for (int i=1; i<=n; i++) cin>>ps[i].x>>ps[i].y;
cin>>m; pre[0] = {1,0,0, 0,1,0, 0,0,1};
for (int i=1; i<=m; i++) {
int t; cin>>t;
if (t == 1) pre[i] = rot_cw();
else if (t == 2) pre[i] = rot_ccw();
else {
int k; cin>>k;
if (t == 3) pre[i] = ref_x(k);
else pre[i] = ref_y(k);
}
pre[i] = pre[i] * pre[i-1];
}
cin>>q;
while (q--) {
int a, b; cin>>a>>b;
point p = pre[a] * ps[b];
cout<<p.x<<' '<<p.y<<endl;
}
}
| #include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define tr(x, it) for(auto (it) = (x).begin();it != (x).end();it++)
#define fo(i, k, n) for(int i = (k);i < (n);i++)
#define Fo(i, k, n) for(int i = (k);i >= (n);i--)
#define el "\n"
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define mii map<int, int>
//#define pqb priority_queue<int>
//#define pqs priority_queue<int, vi, greater<int>>
//#define pc(x) putchar(x);
//#define setbits(x) __builtin_popcountll(x)
//#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
//#define ps(x, y) fixed<<setprecision(y)<<x
//#define mk(arr, n, type) type *arr = new type[n];
//#define w(x) int x; cin>>x; while(x--)
#define deb(x) cout<<#x<< " = "<< x<<"\n";
int a[200], b[200];
int c[20], d[20];
ll ans = 0;
int n, m, k;
void dp(int i, int da[]){
// deb(i)
if(i == k){
// fo(j, 1, n+1) cout<<da[j]<<" ";
// cout<<el;
// fo(j, 1, n+1) cout<<db[j]<<" ";
// cout<<el;
ll cnt = 0;
fo(j, 0, m){
if(da[a[j]] > 0 && da[b[j]] > 0) cnt++;
}
ans = max(ans, cnt);
return;
}
da[c[i]]++;
dp(i+1, da);
da[c[i]]--;
da[d[i]]++;
dp(i+1, da);
da[d[i]]--;
}
void solve(){
cin>>n>>m;
fo(i, 0, m){
cin>>a[i]>>b[i];
}
cin>>k;
fo(i, 0, k){
cin>>c[i]>>d[i];
}
int da[200], db[200];
memset(da, 0, sizeof(da));
memset(db, 0, sizeof(db));
dp(0, da);
cout<<ans;
}
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1;
// cin>>t;
while(t--){
solve();
cout<<el;
}
return 0;
} |
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline T int_ceil(T a, T b) { T res = a / b; if(a % b != 0) res++; return res; }
#include <bits/stdc++.h>
using namespace std;
template<typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
typedef long long ll;
static const int INTINF = (INT_MAX >> 1); // 10^9 + 10^7
static const ll LLINF = (LLONG_MAX >> 1);
// sort(ALL(v), [](auto const& lhs, auto const& rhs) { return lhs > rhs; /* 左の方が大きい...というイメージ。*/ });
// --------------------------------------------------------------------------------------------- //
static const int MAX = 100001;
static const ll MOD = 1000000007;
int main(int argc, const char * argv[]) {
std::cout << std::fixed << std::setprecision(15);
int N, M; cin >> N >> M;
if(N == 1){
if(M == 0){
cout << 1 << " " << 2 << endl;
}
return 0;
}
if(M < 0 || M == N || M == N -1){
cout << -1 << endl;
return 0;
}
vector<pair<int, int> > ans;
ll base = 1000001;
ans.push_back({1, base});
int k = 1;
rep(i, N-1 - M-1){
ans.push_back({base + k, base + k+ 1});
k+= 2;
}
k = 1;
rep(i, M + 1){
ans.push_back({1 + k, 1 + k + 1});
k += 2;
}
sort(ALL(ans));
rep(i, ans.size()){
cout << ans[i].first << " " << ans[i].second << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(begin, end) for (i=begin;i<end;i++)
#define repj(begin, end) for (j=begin;j<end;j++)
#define init(arr, end, val) for (i=0;i<end;i++) arr[i] = val;
#define printint(i0, i1) printf("%d %d\n", i0, i1)
using namespace std;
typedef long long int ll;
const int inf = 1000000000;
const int mod = 1000000007;
const int nil = -1;
int i, n, m, k, ans;
int a[1000];
int main() {
scanf(" %d %d", &n, &m);
if (m == 0) {
rep(0,n) printf("%d %d\n", 2+4*i, 4+4*i);
exit(0);
}
if (m < 0 || m >= n-1) {
printf("-1\n"); exit(0);
}
rep(0,n-1) {
printf("%d %d\n", 2+4*i, 4+4*i);
}
printf("%d %d\n", i*4-m*4-3, i*4-1);
} |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef ENVIRONMENT_LINKED_BOOST
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#endif
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using lpair = std::pair<ll, ll>;
#define REP(i, a, b) for (ll i = a; i < b; ++i)
#define REPREV(i, a, b) for (ll i = a; i > b; --i)
const int _ = []() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(10);
return 0;
}();
template <typename value_t>
void resize(value_t& v, const value_t& val) { v = val; }
template <typename vec_t, typename value_t, typename... arg_t>
void resize(std::vector<vec_t>& v, const value_t& val, int size, arg_t... arg) {
v.resize(size);
for (auto& c : v) resize(c, val, arg...);
}
template <typename A, typename B>
void chmin(A& a, const B& b) { a = min(a, static_cast<A>(b)); };
template <typename A, typename B>
void chmax(A& a, const B& b) { a = max(a, static_cast<A>(b)); };
int main() {
map<ll, vector<int>> mp;
ll N, M;
cin >> N >> M;
REP(i, 0, M) {
ll x, y;
cin >> x >> y;
mp[x].push_back(y);
}
set<ll> cur;
cur.insert(N);
for (auto& [x, v] : mp) {
set<ll> tmp;
for (ll y : v) {
if (cur.count(y - 1) || cur.count(y + 1)) tmp.insert(y);
}
for (ll y : v) cur.erase(y);
cur.insert(tmp.begin(), tmp.end());
}
cout << cur.size() << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, int>;
ll n, m;
int MAX = 400010;
vector<ll> dp(MAX * 2, 0);
vector<vector<int>> G(MAX);
vector<int> seen(MAX, false);
void dfs(int v) {
seen[v] = true;
for (auto &nv : G[v]) {
dp[nv] += dp[v];
if (nv >= MAX || seen[nv]) continue;
dfs(nv);
}
}
int main() {
cin >> n >> m;
vector<set<P>> v(2 * m + 2);
vector<ll> x(m), y(m);
v[m + 1].insert({0, 0});
rep(i, m) {
cin >> x[i] >> y[i];
if (y[i] - n + m + 1 >= 0 && y[i] - n + m + 1 < 2 * m + 2)
v[y[i] - n + m + 1].insert({x[i], i + 1});
}
rep(i, 2 * m + 2) {
if (!v[i].empty()) {
G[(*v[i].rbegin()).second].push_back(MAX + i);
}
}
rep(i, 2 * m + 2) {
if (v[i].empty()) continue;
if (i - 1 >= 0 && v[i - 1].size()) {
auto it1 = v[i - 1].begin();
ll next = 2 * n;
auto it2 = v[i].begin();
while (it2 != v[i].end()) {
it2++;
if (it2 != v[i].end())
next = (*it2).first;
else
next = 2 * n;
it2--;
while (it1 != v[i - 1].end() && (*it1).first <= (*it2).first)
it1++;
while (it1 != v[i - 1].end() && (*it1).first <= next) {
G[(*it2).second].push_back((*it1).second);
it1++;
}
it2++;
}
}
if (i + 1 < 2 * m + 2 && v[i + 1].size()) {
auto it1 = v[i + 1].begin();
ll next = 2 * n;
auto it2 = v[i].begin();
while (it2 != v[i].end()) {
it2++;
if (it2 != v[i].end())
next = (*it2).first;
else
next = 2 * n;
it2--;
while (it1 != v[i + 1].end() && (*it1).first <= (*it2).first)
it1++;
while (it1 != v[i + 1].end() && (*it1).first <= next) {
G[(*it2).second].push_back((*it1).second);
it1++;
}
it2++;
}
}
}
dp[0] = 1;
dfs(0);
ll ans = 0;
for (int i = MAX; i < MAX + 2 * m + 2; i++) ans += dp[i];
cout << ans << endl;
} |
#include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
int main() {
int h, w;
cin >> h >> w;
vector<string>s(h);
rep(i, h) {
cin >> s[i];
}
ll ans(0);
rep(i, h) {
bool ok = false;
rep(j, w) {
if (ok && s[i][j] == '.')ans++;
else if (s[i][j] == '.')ok = true;
else if (s[i][j] == '#')ok = false;
}
}
rep(i, w) {
bool ok = false;
rep(j, h) {
if (ok && s[j][i] == '.')ans++;
else if (s[j][i] == '.')ok = true;
else if (s[j][i] == '#')ok = false;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0); cin.tie(0);
int h, w, count=0; cin >> h >> w;
vector<string> str;
for(int i=0;i<h;i++) {
string s; cin >> s;
str.push_back(s);
}
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
if(str[i][j] == '.' && str[i][j] == str[i][j+1]) count++;
}
}
for(int i=1;i<h;i++) {
for(int j=0;j<w;j++) {
if(str[i][j] == '.' && str[i][j] == str[i-1][j]) count++;
}
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long T, N, prev = 0;
cin >> T >> N;
vector<long long> nums;
for (int a = 1; a <= 100; a++)
{
int x = (100 + T) * a / 100;
if (x != prev + 1)
{
nums.push_back(x - 1);
}
prev = x;
}
int l = nums.size();
N--;
cout << (nums.at(N % l) + (100 + T) * (N / l)) << endl;
} | #include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
long long c = a % i_7;
if(c >= 0) return c;
return c + i_7;
}
long long po(long a, long b){
if(b == 0) return 1;
long long z = po(a , b / 2);
z = mod(z * z);
if(b % 2 != 0) z = mod(a * z);
return z;
}
bool prime_(int n){
if(n == 1){
return false;
}else if(n == 2){
return true;
}else{
for(int i = 2; i <= std::sqrt(n); i++) if(n % i == 0) return false;
return true;
}
}
long long gcd_(long long a, long long b){
if(a < b) std::swap(a,b);
if(a % b == 0) return b;
else return gcd_(b, a % b);
}
long long lcm_(long long x, long long y){
return (x / gcd_(x,y)) * y;
}
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;
int main(){
//using namespace std;
int a[4];
REP(i, 4) cin>>a[i];
int ans = 100;
REP(i, 4) ans = min(ans, a[i]);
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 ll;
typedef pair<int,int> P;
const int MAX_HW = 2005;
const ll MOD = 1e9+7;
char c[MAX_HW][MAX_HW];
ll cntu[MAX_HW][MAX_HW],cntd[MAX_HW][MAX_HW],cntl[MAX_HW][MAX_HW],cntr[MAX_HW][MAX_HW];
ll mypow2[MAX_HW*MAX_HW];
void init()
{
mypow2[0] = 1;
rep(i,MAX_HW*MAX_HW-1)
{
mypow2[i+1] = mypow2[i] * 2 % MOD;
}
}
int main()
{
init();
int H,W;
cin >> H >> W;
ll cnt = 0;
rep(i,H)
{
rep(j,W)
{
cin >> c[i][j];
if (c[i][j] == '.') cnt++;
}
}
ll temp = 0;
rep(i,H)
{
temp = 0;
rep(j,W)
{
if (c[i][j] == '.') temp++;
else temp = 0;
cntl[i][j] = temp;
}
}
temp = 0;
rep(i,H)
{
temp = 0;
for (int j = W-1; j >= 0; --j)
{
if (c[i][j] == '.') temp++;
else temp = 0;
cntr[i][j] = temp;
}
}
temp = 0;
rep(j,W)
{
temp = 0;
rep(i,H)
{
if (c[i][j] == '.') temp++;
else temp = 0;
cntu[i][j] = temp;
}
}
temp = 0;
rep(j,W)
{
temp = 0;
for (int i = H-1; i >= 0; --i)
{
if (c[i][j] == '.') temp++;
else temp = 0;
cntd[i][j] = temp;
}
}
/*
rep(i,H)
{
rep(j,W)
{
cout << cntr[i][j] << " ";
}
cout << endl;
}
*/
ll ans = 0;
rep(i,H)
{
rep(j,W)
{
if (c[i][j] == '.')
{
temp = cntr[i][j] + cntl[i][j] + cntd[i][j] + cntu[i][j] - 3;
ll temp2 = ((mypow2[temp] - 1 + MOD) % MOD) * mypow2[cnt-temp] % MOD;
ans = (ans + temp2) % MOD;
//cout << temp << " " << ans << endl;
}
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#define ll long long
//我把题目读成求周长段数的还有救嘛……
using namespace std;
bool s[11][11];
bool pd(ll i,ll j){
ll he=s[i][j]+s[i][j+1]+s[i+1][j]+s[i+1][j+1];
if(he==1 or he==3) return 1;
else return 0;
}
int main(){
ll h,w,i,j,sl=0;
char sr;
cin>>h>>w;
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin>>sr;
if(sr=='.') s[i][j]=0;
else s[i][j]=1;
}
}
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
if(pd(i,j)) sl++;
}
}
cout<<sl;
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 (1LL << 50)
#define MOD (1e9+7)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
//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新しい
/****Union-Find-Tree***/
int par[int(0x7ffffff)];//Parent
int Rank[int(0x7ffffff)];//Deep_of_the_Tree
//n要素で初期化
void init(int n) {
for (int i = 0; i < n; i++) {
par[i] = i;
Rank[i] = 0;
}
}
//木の根探し
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//xとyの属する集合を併合
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)return;
if (Rank[x] < Rank[y]) {
par[x] = y;
}
else {
par[y] = x;
if (Rank[x] == Rank[y])Rank[x]++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int N, M;
vector<int>G[25]; int V[25],id[25]; int c = 0;
int color[25]; bool used[25];
bool dfs(int u,int prec) {
if (used[u])return true;
if (c >> id[u] & 1) {
prec += 2; prec %= 3;
}
else {
prec++; prec %= 3;
}
for (int to : G[u]) {
if (used[to] && color[to] == prec)return false;
}
color[u] = prec;
used[u] = true;
for(int to : G[u]) {
if (!dfs(to, prec))return false;
}
return true;
}
int32_t main() {
cin >> N >> M;
init(N);
rep(i, M) {
int a, b; cin >> a >> b;
a--; b--;
unite(a, b);
G[a].push_back(b); G[b].push_back(a);
}
rep(i, N) {
id[i] = V[find(i)];
V[find(i)]++;
}
ll res = 1;
rep(i, N) {
if (V[i]==0)continue;
ll cnt = 0;
rep(j, (1 << V[i])) {
c = j;
rep(k, 3) {
fill(color, color + 22, -1);
fill(used, used + 22, false);
color[i] = k; used[i] = true;
bool flag = true;
for (int to : G[i]) {
if (!dfs(to, k))flag = false;
}
cnt += flag;
}
}
cnt /= 2LL;
res *= cnt;
}
cout << res << endl;
} | #include<bits/stdc++.h>
#define MAX 20
#define MOD 1000000007
using namespace std;
vector<int> v[MAX+10];
int c[MAX+10];
bool vis[MAX+10];
bool dfs(int x)
{
vis[x] = true;
bool ans = true;
for(int y:v[x])
{
if(c[y]==-1)
continue;
if(vis[y])
ans = ans&&(c[x]!=c[y]);
else
c[y] = 1-c[x], ans = ans&&dfs(y);
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>n>>m;
while(m--)
{
int x,y;
cin>>x>>y;
--x, --y;
v[x].push_back(y);
v[y].push_back(x);
}
int lmt = 1<<n;
long long ans = 0;
for(int i=0;i<lmt;++i)
{
for(int j=0;j<n;++j)
{
if(i&(1<<j))
c[j] = -1;
else c[j] = 0;
vis[j] = false;
}
long long tmp = 1;
bool ok = true;
for(int j=0;ok&&j<n;++j)
{
if(!vis[j]&&c[j]!=-1)
ok = ok&&dfs(j), tmp *= 2;
else if(c[j]==-1)
for(int x:v[j])
if(c[x]==-1)
ok = false;
}
if(ok)
ans += tmp;
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct xy {
int x;
int y;
};
const int n = 50;
vector<vector<int>> t(n, vector<int>(n));
vector<vector<int>> p(n, vector<int>(n));
xy s;
clock_t start;
string ans = "";
int maxPoint = 0;
void input () {
cin >> s.x >> s.y;
rep(i, n) rep(j, n) cin >> t[i][j];
rep(i, n) rep(j, n) cin >> p[i][j];
}
bool isTimeLimit(clock_t start) {
clock_t end = clock();
const double time = static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;
if (time >= 500) return true;
else return false;
}
int cnt = 0;
void dfs(int mode, xy now, int point, string tmpans, set<int> step) {
cnt++;
// タイムリミット
if (cnt%500 == 0) {
if (isTimeLimit(start)) {
cout << ans << endl;
exit(0);
}
}
switch (mode) {
case 0: now.x--; break;
case 2: now.x++; break;
case 1: now.y--; break;
case 3: now.y++; break;
}
if (!(now.x >= 0 && now.x <= 49 && now.y >= 0 && now.y <= 49)) {
return ;
}
auto it = step.find(t[now.x][now.y]);
if (it != step.end()) return;
step.insert(t[now.x][now.y]);
switch (mode) {
case 0: tmpans += "U"; break;
case 2: tmpans += "D"; break;
case 1: tmpans += "L"; break;
case 3: tmpans += "R"; break;
}
point += p[now.x][now.y];
if (point > maxPoint) {
maxPoint = point;
ans = tmpans;
}
rep(i, 4) dfs(i, now, point, tmpans, step);
return;
}
int main() {
// 入力
input();
start = clock();
rep(i, n) {
// 初期化
xy now;
now.x = s.x;
now.y = s.y;
set<int> step; // 踏んだタイル番号を保持
step.insert(t[now.x][now.y]);
string tmpans = "";
int point = 0;
// 進む方向探索
// 0：上、1：下、2：左、3：右
dfs(i, now, point, tmpans, step);
}
return 0;
} |
#include <time.h>
#include <stdlib.h>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <cstdint>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
#include <map>
#include <set>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <bitset>
#include <iterator>
#include <deque>
#include <random>
#include <string>
#include <queue>
#include <omp.h>
#include <fstream> // ifstream, ofstream
typedef int64_t ll;
using namespace std;
const ll INF=1e16;
const double EPS=1e-8;
const ll mod = 1000000007;
const int BOARD_SIZE=50;
struct Status{
vector<bool> tile_passed;
int ci=0;
int cj=0;
int current_point = 0;
string route = "";
bool operator<(const Status& cmp) const{
return current_point>cmp.current_point;
}
};
int t[BOARD_SIZE][BOARD_SIZE];
int p[BOARD_SIZE][BOARD_SIZE];
vector<Status> generate_next(Status current, int min_ci, int max_ci, int min_cj, int max_cj){
vector<Status> retval;
Status temp;
if(current.ci>min_ci && !current.tile_passed[t[current.ci-1][current.cj]]){
temp = Status(current);
temp.ci=current.ci-1;
temp.current_point+=p[temp.ci][temp.cj];
temp.tile_passed[t[temp.ci][temp.cj]]=true;
temp.route+="U";
retval.push_back(temp);
}
if(current.ci<max_ci && !current.tile_passed[t[current.ci+1][current.cj]]){
temp = Status(current);
temp.ci=current.ci+1;
temp.current_point+=p[temp.ci][temp.cj];
temp.tile_passed[t[temp.ci][temp.cj]]=true;
temp.route+="D";
retval.push_back(temp);
}
if(current.cj>min_cj && !current.tile_passed[t[current.ci][current.cj-1]]){
temp = Status(current);
temp.cj=current.cj-1;
temp.current_point+=p[temp.ci][temp.cj];
temp.tile_passed[t[temp.ci][temp.cj]]=true;
temp.route+="L";
retval.push_back(temp);
}
if(current.cj<max_cj && !current.tile_passed[t[current.ci][current.cj+1]]){
temp = Status(current);
temp.cj=current.cj+1;
temp.current_point+=p[temp.ci][temp.cj];
temp.tile_passed[t[temp.ci][temp.cj]]=true;
temp.route+="R";
retval.push_back(temp);
}
return retval;
}
int main(){
int si,sj;
cin>>si>>sj;
int temp;
for(int i=0;i<BOARD_SIZE;i++){
for(int j=0;j<BOARD_SIZE;j++){
cin>>temp;
t[i][j]=temp;
}
}
for(int i=0;i<BOARD_SIZE;i++){
for(int j=0;j<BOARD_SIZE;j++){
cin>>temp;
p[i][j]=temp;
}
}
vector<Status> *current = new vector<Status>();
vector<Status> *next = new vector<Status>();
Status initial;
for(int i = 0;i<BOARD_SIZE*BOARD_SIZE;i++){
initial.tile_passed.push_back(false);
}
initial.ci=si;
initial.cj=sj;
initial.tile_passed[t[si][sj]]=true;
initial.current_point=p[si][sj];
next->push_back(initial);
int best_point = 0;
string best_route="";
int best_ci,best_cj;
for(int cnt=0;cnt<400;cnt++){
delete current;
current = next;
next = new vector<Status>();
for(auto i = current->begin();i!=current->end();i++){
//try 4 neighbour
vector<Status> next_result = generate_next(*i,0,49,0,49);
std::copy(next_result.begin(),next_result.end(),std::back_inserter(*next));
}
sort(next->begin(),next->end());
if(next->size()>0 && next->at(0).current_point>best_point){
best_point = next->at(0).current_point;
best_route = next->at(0).route;
}
/*for(auto i1=next->begin();i1!=next->end();i1++){
if(i1->ci==17){
best_point = i1->current_point;
best_route = i1->route;
best_ci = i1->ci;
best_cj = i1->cj;
break;
}
}*/
if(next->size()>1000){
vector<Status> *shuffled_next = new vector<Status>();
copy(next->begin(),next->begin()+200,std::back_inserter(*shuffled_next));
std::random_device seed_gen;
std::mt19937 engine(seed_gen());
shuffle(next->begin()+200,next->end(),engine);
copy(next->begin()+200,next->begin()+1000,std::back_inserter(*shuffled_next));
delete next;
next = shuffled_next;
}
}
cout<<best_route<<endl;
}
|
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
#include <cassert>
#include <numeric>
//#pragma region ACL
//#include <atcoder/fenwicktree>
////#include <atcoder/math>
//#include <atcoder/string>
//#include <atcoder/scc>
//#include <atcoder/segtree>
//#include <atcoder/lazysegtree>
//#pragma endregion
using namespace std;
//using namespace atcoder;
typedef long long ll;
//#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i))
#define rep(i, e) for (int(i) = 0; (i) < (e); ++(i))
#define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i))
#define all(x) x.begin(),x.end()
#pragma region UnionFind
struct UnionFind
{
vector<int> par;
UnionFind(int n) : par(n, -1) {}
void init(int n) { par.assign(n, -1); }
int root(int x)
{
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y)
{
return root(x) == root(y);
}
bool merge(int x, int y)
{
x = root(x); y = root(y);
if (x == y) return false;
if (par[x] > par[y]) swap(x, y);
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x)
{
return -par[root(x)];
}
};
#pragma endregion
#pragma region GCD
int gcd(int a, int b)
{
if (a%b == 0)return b;
return gcd(b, a%b);
}
#pragma endregion
#pragma region chmin
template<class T> inline bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma region chmax
template<class T> inline bool chmax(T& a, T b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
#pragma endregion
#pragma endregion
int main()
{
int a, b; cin >> a >> b;
cout << (a + b) / 2 << " " << (a - b) / 2 << endl;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <functional>
#include <cassert>
#include <stack>
#include <numeric>
#include <iomanip>
#include <limits>
#include <random>
#include <unordered_set>
#include <chrono>
typedef int64_t ll;
typedef std::pair<int, int> Pii;
typedef std::pair<ll, ll> Pll;
typedef std::pair<double, double> Pdd;
#define rip(_i, _n, _s) for (int _i = (_s); _i < (int)(_n); _i++)
#define all(_l) _l.begin(), _l.end()
#define rall(_l) _l.rbegin(), _l.rend()
#define MM << " " <<
template<typename _T>
using MaxHeap = std::priority_queue<_T>;
template<typename _T>
using MinHeap = std::priority_queue<_T, std::vector<_T>, std::greater<_T>>;
template<typename _T>
inline bool chmax(_T &_l, const _T _b) {
if (_l < _b) {
_l = _b;
return true;
}
return false;
}
template<typename _T>
inline bool chmin(_T &_l, const _T _b) {
if (_l > _b) {
_l = _b;
return true;
}
return false;
}
template<typename _T>
void vdeb(const std::vector<_T> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
if (i == bb.size() - 1) std::cout << bb[i];
else std::cout << bb[i] << ' ';
}
std::cout << '\n';
}
template<typename _T>
void vdeb(const std::vector<std::vector<_T>> &bb) {
for (unsigned int i = 0;i < bb.size();i++) {
// std::cout << i << ' ';
vdeb(bb[i]);
}
std::cout << '\n';
}
using namespace std;
bool ju(vector<vector<int>> &da, int n, int k, int d) {
vector<vector<int>> li(n+1, vector<int>(n+1));
rip(i,n,0) rip(j,n,0) li[i+1][j+1] = (da[i][j] >= d);
rip(i,n+1,0) rip(j,n,0) li[i][j+1] += li[i][j];
rip(i,n+1,0) rip(j,n,0) li[j+1][i] += li[j][i];
int cnt = 0;
rip(i,n-k+1,0) rip(j,n-k+1,0) {
int su = li[i][j] + li[i+k][j+k] - li[i+k][j] - li[i][j+k];
cnt += (su > k*k/2);
}
return cnt == (n-k+1)*(n-k+1);
}
int main() {
int n, k; cin >> n >> k;
vector<vector<int>> da(n, vector<int>(n));
rip(I,n,0) rip(j,n,0) cin >> da[I][j];
int ng = INT_MAX/2, ok = -1;
while(abs(ng-ok) > 1){
int now = (ok + ng)/2;
if(ju(da, n, k, now)) {
ok = now;
}
else{
ng = now;
}
}
cout << ok << endl;
} |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define neinf 0xc0c0c0c0c0c0c0c0ll
#define inf 0x3f3f3f3f3f3f3f3fll
#define uint unsigned int
#define ull unsigned ll
#define HgS 1000000007
#define ll long long
#define reg register
#define opr operator
#define ret return
#define gc getchar
#define pc putchar
#define cst const
#define db double
#define il inline
il ll rd()
{
reg ll res=0,lab=1;
reg char ch=gc();
while((ch<'0'||ch>'9')&&ch!=EOF)
{if(ch=='-')lab=-lab;ch=gc();}
while(ch>='0'&&ch<='9')
res=(res<<3)+(res<<1)+(ch&15),ch=gc();
return res*lab;
}
il void prt(ll x,char t='\n')
{
static char ch[40];reg int tp=0;
if(!x){fputs("0",stdout);if(t)pc(t);return;}
if(x<0)pc('-'),x=-x;
while(x)ch[++tp]=(x%10)^48,x/=10;
while(tp)pc(ch[tp--]);
if(t)pc(t);
}
il ll umax(ll a,ll b){return a>b?a:b;}
il ll umin(ll a,ll b){return a<b?a:b;}
il ll uabs(ll x){return x>0?x:-x;}
il ll qpow(ll n,ll e=HgS-2,ll p=HgS)
{
reg ll res=1;
while(e){if(e&1)res=res*n%p;n=n*n%p;e>>=1;}
return res;
}
ll n,a[200005],maxa[200005],sum[200005],ts[200005],b;
int main()
{
n=rd();for(int i=1;i<=n;++i)a[i]=rd(),maxa[i]=umax(maxa[i-1],a[i]);
for(int i=1;i<=n;++i)sum[i]=sum[i-1]+a[i],ts[i]=ts[i-1]+sum[i];
for(int i=1;i<=n;++i)prt(maxa[i]*i+ts[i]);
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+1000;
int n;
int a[N];
ll sum[N],ans[N];
int mx[N] ;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
mx[i] = max(mx[i-1],a[i]);
sum[i]=sum[i-1]+a[i];
ans[i]=ans[i-1]+sum[i];
}
for(int i=1;i<=n;i++){
printf("%lld\n",ans[i]+1ll*mx[i]*i);
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (r)-1; (l) <= i; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0)
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((int)(c).size())
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<ll, ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VD = vector<double>;
using VVD = vector<VD>;
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const int INF = (1 << 30) - 1; // 1073741824 - 1
// static const ll INF = (1LL << 60) - 1; // 4611686018427387904 - 1
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
const 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);
int n;
cin >> n;
VLL A(n), B(n);
REP(i, n) {
cin >> A[i] >> B[i];
}
ll ans = INF;
REP(i, n) {
REP(t, n) {
if (i == t) {
chmin(ans, A[i] + B[t]);
} else {
chmin(ans, max(A[i], B[t]));
}
}
}
COUT(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
string complement(string s)
{
string t="";
for(int i=0;i<s.length();i++)
{
if(s.at(i)=='A')
t+='B';
else
t+='A';
}
return t;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int power2[9];
power2[0]=1;
for(int i=1;i<9;i++)
power2[i]=power2[i-1]*2;
vector<string> ans[9];
for(int i=1;i<9;i++)
{
for(int j=0;j<ans[i-1].size();j++)
{
string z=ans[i-1][j];
string w=complement(z);
string x=z+z;
string y=z+w;
ans[i].push_back(x);
ans[i].push_back(y);
}
string a="";
for(int j=0;j<power2[i-1];j++)
{
a+='A';
}
for(int j=0;j<power2[i-1];j++)
{
a+='B';
}
ans[i].push_back(a);
}
int tt=1;
//cin >> tt;
while(tt--)
{
int n;
cin >> n;
cout << ans[n].size() << '\n';
for(int i=0;i<ans[n].size();i++)
cout << ans[n][i] << '\n';
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define REP(i,L,R) for(int i=L;i<R;i++)
using namespace std;
typedef vector<vector<int>> Graph;
//main area
int main(){
int N;
cin >> N;
vector<int> A(N);
A[0] = 105;
int k = 1;
rep1(i,10000){
if(i%3==0 || i%5==0 || i%7==0){
A[k] = 2*i;
k++;
if(k==N) break;
}
}
// cout << A[N-1] << endl;
rep(i,N){
cout << A[i] << (i==N-1?'\n':' ');
}
}
/*
*/ | #include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using PIL = pair<int, LL>;
using PLL = pair<LL, LL>;
// constexpr int mod = 1e9 + 7;
// constexpr int mod = 998244353;
inline void quickread() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int n;
inline void work() {
cin >> n;
cout << "6 10 15";
int p = 16;
for (int i = 4; i <= n; ++i) {
while (p % 6 != 0 && p % 10 != 0 && p % 15 != 0) {
++p;
}
cout << " " << p;
++p;
}
cout << "\n";
}
int main() {
// freopen("input.txt", "r", stdin);
quickread();
work();
return 0;
} |
/**
* author:
* created: 15.11.2020 20:57:58
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repn(i,n) for(int i = 1; i <= (n); i++)
#define pb push_back
void debug_out() { cout << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return true;
}
return false;
}
const double PI = acos(-1);
const int mod = 1000000007;
class mint {
long long x;
public:
mint(long long x=0) : x((x%mod+mod)%mod) {}
mint operator-() const {
return mint(-x);
}
mint& operator+=(const mint& a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint& a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint& a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint& a) const {
mint res(*this);
return res+=a;
}
mint operator-(const mint& a) const {
mint res(*this);
return res-=a;
}
mint operator*(const mint& a) const {
mint res(*this);
return res*=a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
return a;
}
// for prime mod
mint inv() const {
return pow(mod-2);
}
mint& operator/=(const mint& a) {
return (*this) *= a.inv();
}
mint operator/(const mint& a) const {
mint res(*this);
return res/=a;
}
friend ostream& operator<<(ostream& os, const mint& m){
os << m.x;
return os;
}
};
#pragma endregion
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int x;
cin >> x;
if(x >= 0) cout << x << endl;
else cout << 0 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define il inline
#define ri register int
#define ll long long
#define ui unsigned int
il ll read(){
bool f=true;ll x=0;
register char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') f=false;ch=getchar();}
while(ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
if(f) return x;
return ~(--x);
}
il int read(char *s){
int len=0;
register char ch=getchar();
while(ch==' '||ch=='\n') ch=getchar();
while(ch!=' '&&ch!='\n'&&ch!=EOF) s[++len]=ch,ch=getchar();
return len;
}
il void write(const ll &x){if(x>9) write(x/10);putchar(x%10+'0');}
il void print(const ll &x) {x<0?putchar('-'),write(~(x-1)):write(x);putchar('\n');}
il ll max(const ll &a,const ll &b){return a>b?a:b;}
il ll min(const ll &a,const ll &b){return a<b?a:b;}ll n;
string c;
const ll mod =1e9+7;
il ll ksm(ll d,ll t){
ll res=1;
for(;t;t>>=1,d=d*d%mod)
if(t&1) res=res*d%mod;
return res;
}
struct hmap{
static const int P=2e6+3,M=3e6+10;
int hed[M],nxt[M],cnt;ll val[M];ll as[M];
bool count(ll x){
int c=hed[x%P];
while(c){
if(val[c]==x) return 1;
c=nxt[c];
}return 0;
}
ll& operator [](ll x){
int c=hed[x%P];
while(c){
if(val[c]==x) return as[c];
c=nxt[c];
}
++cnt;val[cnt]=x;nxt[cnt]=hed[x%P];hed[x%P]=cnt;
return as[cnt];
}
int size(){return cnt;}
}f;
ll get_f(ll tmp){
if(f.count(tmp)) return f[tmp]%mod;
if(tmp&1) return f[tmp]=((get_f(tmp/2+1)*get_f(tmp/2+1)%mod)+(get_f(tmp/2)*get_f(tmp/2)%mod))%mod;
else return f[tmp]=get_f(tmp/2)*((get_f(tmp/2+1)+get_f(tmp/2-1))%mod)%mod;
}
int main(){
n=read();
c="";
string t;
t=getchar(),c=c+t,getchar();
t=getchar(),c=c+t,getchar();
t=getchar(),c=c+t,getchar();
t=getchar(),c=c+t,getchar();
if(n==2||c=="AAAA"||c=="AAAB"||c=="AABA"||c=="AABB"||c=="ABAB"||c=="ABBB"||c=="BBAB"||c=="BBBB"){
print(1);
return 0;
}
else if(c=="ABAA"||c=="BABA"||c=="BABB"||c=="BBAA"){
print(ksm(2,n-3));
return 0;
}
else if(c=="BAAA"||c=="ABBA"||c=="BBBA"||c=="BAAB"){
f[1]=f[2]=1;
print(get_f(n-1));
return 0;
}
return 0;
}
/*
1000
B
A
A
A
589888339
*/ |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <unordered_map>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
vector<int> g[2010];
vector<int> w[2010];
const int MX = 1e9;
int d[2010];
struct node {
int u;
int dd;
node(int _u) {
u = _u;
dd = d[u];
}
};
int visit[2010];
bool operator<(const node& a, const node& b) {
return a.dd > b.dd;
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
g[a].push_back(b);
w[a].push_back(c);
}
for (int s = 1; s <= n; ++s) {
//printf("src=%d\n", s);
priority_queue<node> q;
for (int i = 1; i <= n; ++i) {
d[i] = MX;
visit[i] = 0;
}
for (int j = 0; j < g[s].size(); ++j) {
d[g[s][j]] = min(d[g[s][j]], w[s][j]);
}
for (int j = 0; j < g[s].size(); ++j) {
q.push(node(g[s][j]));
}
while (!q.empty() && !visit[s]) {
node cur = q.top();
int x = cur.u;
//printf(" x=%d\n", x);
q.pop();
if (visit[x]) continue;
visit[x] = 1;
//printf(" visit x=%d d[x]=%d\n", x, d[x]);
for (int j = 0; j < g[x].size(); ++j) {
int y = g[x][j];
if (!visit[y]) {
if (d[x] + w[x][j] < d[y]) {
d[y] = d[x] + w[x][j];
q.push(node(y));
//printf(" relax y=%d d[y]=%d\n", y, d[y]);
}
}
}
}
if (visit[s]) {
printf("%d\n", d[s]);
} else {
printf("-1\n");
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using ll = long long;
using P = pair<int,int>;
using edge = struct { int to; int cost; };
const int INF = 1e9;
int n,m;
vector<int> a,b,c;
vector<vector<edge>> g;
void solve(int s) {
vector<int> d(n+5, INF);
priority_queue<P, vector<P>, greater<P>> que;
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top(); que.pop();
int v = p.second;
if (d[v] < p.first) continue;
REP(i,g[v].size()) {
edge e = g[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
int ans = INF;
REP(i,n) {
if (d[i] == INF) continue;
for(auto x: g[i]) {
if (x.to == s) ans = min(ans, d[i] + x.cost);
}
}
cout << (ans == INF ? -1 : ans) << endl;
return;
}
int main() {
cin >> n >> m;
a.resize(m); b.resize(m); c.resize(m);
g.resize(n);
REP(i,m) {
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
edge e = { b[i], c[i] };
g[a[i]].emplace_back(e);
}
REP(i,n) solve(i);
return 0;
} |
#include "iostream"
using namespace std;
int main() {
int a, b, w;
cin >> a >> b >> w;
w *= 1000;
const int INF = 1001001001;
int l = INF, r = -INF;
for (int n = 1; n <= w; ++n) {
if (a*n <= w && w <= b*n) {
l = min(l, n);
r = max(r, n);
}
}
if (l == INF) {
cout << "UNSATISFIABLE" << endl;
} else {
cout << l << " " << r << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#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);
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
double cx = gx - sx;
double cy = gy / sy;
double dx = cx * (1 / (1 + cy));
cout << fixed << std::setprecision(10) << sx + dx << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pf push_front
#define pb push_back
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define ROF(i,r,l) for(int i=r;i>=l;i--)
#define all(v) (v).begin(),(v).end()
#define ff first
#define ss second
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pair<int,int>> vpi;
typedef vector<vi> vvi;
const int M = 1e9+7;
const int N = 2e5;
int po(int,int);
int n,m;
int k;
int a[105],b[105],c[20],d[20];
map<int,int> mp;
int ans = 0;
void f(int id){
if(id == k+1){
int s = 0;
FOR(i,1,m+1){
if(mp[a[i]] > 0 && mp[b[i]] > 0){
s++;
}
}
ans = max(ans,s);
return;
}
else{
mp[c[id]]++;
f(id+1);
mp[c[id]]--;
mp[d[id]]++;
f(id+1);
mp[d[id]]--;
}
}
void solve(){
cin>>n>>m;
FOR(i,1,m+1){
cin>>a[i]>>b[i];
}
cin>>k;
FOR(i,1,k+1){
cin>>c[i]>>d[i];
}
f(1);
cout<<ans<<"\n";
}
int32_t 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);
#endif
int t=1;
// cin>>t;
FOR(i,1,t+1){
//cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
int po(int a,int b){
if(b==0) return 1;
int ans=1;
if(b%2==0){
ans = po(a,b/2)%M;
ans=(ans%M * ans%M)%M;
}
else{
ans = po(a,(b-1)/2)%M;
ans = (ans%M * ans%M * a)%M;
}
return ans%M;
}
| #include<bits/stdc++.h>
#define rep(i,N) for(ll (i)=0;(i)<(N);(i)++)
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1000000007;
const int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
rep(i, m) {
cin >> a[i] >> b[i];
a[i]--; b[i]--;
}
int k;
cin >> k;
vector<int> c(k), d(k);
rep(i, k) {
cin >> c[i] >> d[i];
c[i]--; d[i]--;
}
int ans = 0;
rep(t, 1<<k) {
vector<int> v(n, 0);
rep(i, k) {
if (t>>i&1) v[c[i]]++;
else v[d[i]]++;
}
int cnt = 0;
rep(i, m) {
if (v[a[i]] && v[b[i]]) cnt++;
}
// rep(i, n) cout << v[i] << endl;
chmax(ans, cnt);
}
cout << ans << endl;
} |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ull> ull1d;
typedef vector<ull1d> ull2d;
typedef vector<ull2d> ull3d;
#define loop(i,n) for(ull i=0;i<n;i++)
#define rloop(i,n) for(ll i=n-1;i>=0;i--)
#define all(vec) vec.begin(),vec.end()
template<class T> inline bool chmin(T& a,T b){ if(a>b){ a=b; return true;} return false; }
template<class T> inline bool chmax(T& a,T b){ if(a>b){ a=b; return true;} return false; }
int main(){ cout << fixed << setprecision(15);
int n,m;
cin >> n >> m;
vector<string> a,b(m);
loop(i,m){ cin >> b[i]; }
sort(all(b),[](string &x, string &y){ return x.size() > y.size(); });
loop(i,b.size()) for(int j=i+1;j<b.size();j++){
if(b[i].find(b[j]) != string::npos){
b.erase(b.begin()+j);
}
}
string prev = "";
loop(i,b.size()){
if(prev.size() + b[i].size() > n){
int l = n-prev.size();
auto itr = find_if(all(b),[l](string x){ return x.size() == l; });
if(itr == b.end()){
loop(j,l){ prev += "."; }
}
else{
prev += *itr;
b.erase(itr);
}
a.push_back(prev);
prev = "";
}
prev += b[i];
}
loop(i,n){
cout << a[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int edge[10][10], mark[10];
int n, k, v = 1, ans = 0;
void dfs(int cur, int dst) {
if(dst > k) return;
if(v == n) {
if(dst + edge[0][cur] == k) ans ++;
return;
}
else {
for(int i = 0; i <= n; i++) {
if(mark[i] == 0) {
mark[i] = 1;
v ++;
//cout<<cur<<' '<<i<<' '<<dst<<endl;
dfs(i, dst + edge[cur][i]);
mark[i] = 0;
v --;
}
}
return;
}
}
int main() {
cin>>n>>k;
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
cin>>edge[i][j];
}
}
memset(mark, 0, sizeof(mark));
mark[0] = 1;
dfs(0, 0);
cout<<ans;
return 0;
} |
#include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second
using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};
ll mod(ll a, ll mod){
ll res = a%mod;
if(res<0)res=res + mod;
return res;
}
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res=res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
ll b=mod, u=1, v=0;
while(b){
ll t=a/b;
a-=t*b; swap(a, b);
u-=t*v; swap(u, v);
}
u%=mod;
if(u<0)u+=mod;
return u;
}
ll gcd(ll a, ll b){
ll r = a%b;
if(r==0) return b;
else return gcd(b, a%b);
}
bool is_prime(ll n){
ll i = 2;
if(n==1)return false;
if(n==2)return true;
bool res = true;
while(i*i <n){
if(n%i==0){
res = false;
}
i = i+1;
}
//if(i==1)res = false;
if(n%i==0)res=false;
return res;
}
/**************************************
** A main function starts from here **
***************************************/
int main(){
llvec v(4);
ll ans = 1e18;
rep(i, 4)cin >> v[i];
rep(i, 4)ans = min(ans,v[i]);
cout<< ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int main(){
string s;
cin>>s;
map<int,int> mp;
rep(i,s.size()){
int num=(int)(s[i]-'0');
mp[num]++;
}
if(s.size()==1){
if(mp[8]==1) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
if(s.size()==2){
for(int i=10; i<100; i++){
if(i%8!=0) continue;
bool ok=1;
map<int,int> cnt;
int tmp=i;
rep(j,2){
int d=tmp%10;
cnt[d]++;
tmp/=10;
}
for(auto x : cnt){
if(x.second>mp[x.first]) ok=0;
}
if(ok){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
for(int i=100; i<1000; i++){
if(i%8!=0) continue;
bool ok=1;
map<int,int> cnt;
int tmp=i;
rep(j,3){
int d=tmp%10;
cnt[d]++;
tmp/=10;
}
for(auto x : cnt){
if(x.second>mp[x.first]) ok=0;
}
if(ok){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,sum=0,res=0;
cin>>n;
long long a[n];
long long mod= 998244353;
for(long long i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n,greater<long long>());
for(long long i=0;i<n;i++)
{
res+=(a[i]*a[i]);
res+=(a[i]*sum);
res=res%mod;
sum=sum*2;
sum+=a[i];
sum=sum%mod;
}
cout<<res;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
int ans = INT_MAX;
for (int i = 0; i < (1<<(n-1)); i++)
{
int in, out;
in = out = 0;
for (int j = 0; j < n; j++)
{
in |= a[j];
if (i&1<<j)
{
out ^= in;
in = 0;
}
}
out ^= in;
ans = min(ans, out);
}
cout << ans << endl;
}
|
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> a(h);
for (auto &x: a) cin >> x;
unordered_map<char, vector<Pii> > teleporterLocation;
Pii start;
Pii goal;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if ('a' <= a[i][j] && a[i][j] <= 'z') teleporterLocation[a[i][j]].emplace_back(i, j);
else if (a[i][j] == 'S') start = Pii(i, j);
else if (a[i][j] == 'G') goal = Pii(i, j);
}
}
vector<vector<bool> > visited(h, vector<bool>(w));
unordered_map<char, bool> teleporterVisited;
queue<vector<int> > que;
que.push(vector<int>({start.first, start.second, 0}));
int ans = -1;
while (!que.empty()) {
auto now = que.front();
que.pop();
if (visited[now[0]][now[1]]) continue;
visited[now[0]][now[1]] = true;
if (now[0] == goal.first && now[1] == goal.second) {
ans = now[2];
break;
}
if ('a' <= a[now[0]][now[1]] && a[now[0]][now[1]] <= 'z') {
if (!teleporterVisited[a[now[0]][now[1]]]) {
teleporterVisited[a[now[0]][now[1]]] = true;
for (auto &x: teleporterLocation[a[now[0]][now[1]]]) {
if (!visited[x.first][x.second]) que.push(vector<int>({x.first, x.second, now[2]+1}));
}
}
}
if (now[0] > 0) {
if (a[now[0]-1][now[1]] != '#' && !visited[now[0]-1][now[1]]) que.push(vector<int>({now[0]-1, now[1], now[2]+1}));
}
if (now[0] < h-1) {
if (a[now[0]+1][now[1]] != '#' && !visited[now[0]+1][now[1]]) que.push(vector<int>({now[0]+1, now[1], now[2]+1}));
}
if (now[1] > 0) {
if (a[now[0]][now[1]-1] != '#' && !visited[now[0]][now[1]-1]) que.push(vector<int>({now[0], now[1]-1, now[2]+1}));
}
if (now[1] < w-1) {
if (a[now[0]][now[1]+1] != '#' && !visited[now[0]][now[1]+1]) que.push(vector<int>({now[0], now[1]+1, now[2]+1}));
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i>=b;i--)
#define ll unsigned int
#define test int t;cin>>t; while(t--)
#define en '\n'
typedef pair<int, int> pii;
typedef pair<char, int> pci;
typedef pair<char, char> pcc;
typedef vector<pii> vii;
typedef long double ld;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(x) (int)x.size()
#define INF (1e18+5)
#define inf (1e9+5)
#define mod 1000000007
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
// You should only debug a pair of simple data types. For example,
// the debug won't work if one of pair's elements is collection type
// (std::vector, std::map, std::set...).
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// bool check_prime(int n) return whether a number is prime or not O(sqrt(N));
// int BE(int x,int n,int m) return x^n%m; O(logN);
// void sieve() from number 1-1000001 saare prime store kar lega in bool is_prime[1000001] array
// vector<int> z_array(string s) return vector which is Z-array of string s;
// vector<int> lps(string s) return vector which is lps array of string s;
// int power(int x,int n) return x^n; O(logN);
// using_ordered_set (template for using ordered set , replace first 2 lines of this page with this code..);
const int gf = 2e3 + 9;
int dx[4] = { -1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
char s[gf][gf];
vii v[26];
bool vis[gf][gf];
int dis[gf][gf];
bool vis2[gf];
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
#ifndef ONLINE_JUDGE
if (fopen("input.txt", "r"))
{
freopen ("input.txt" , "r" , stdin);
freopen ("output.txt" , "w" , stdout);
}
#endif
//_______________________________-code starts-_______________________________________________
int h, w;
cin >> h >> w;
pii source;
pii dest;
rep(i, 0, gf - 1)rep(j, 0, gf - 1)s[i][j] = '#';
rep(i, 1, h)
{
rep(j, 1, w)
{
cin >> s[i][j];
if (s[i][j] >= 'a' && s[i][j] <= 'z')
v[s[i][j] - 'a'].pb({i, j});
if (s[i][j] == 'S')
{
source = {i, j};
}
else if (s[i][j] == 'G')
{
dest = {i, j};
}
}
}
queue<pii>q;
q.push(source);
vis[source.ff][source.ss] = 1;
while (sz(q))
{
pii node = q.front();
q.pop();
int x = node.ff;
int y = node.ss;
zip(i, 0, 4)
{
int x1 = x + dx[i];
int y1 = y + dy[i];
if (s[x1][y1] == '#')
continue;
if (vis[x1][y1])
continue;
vis[x1][y1] = 1;
q.push({x1, y1});
dis[x1][y1] = dis[x][y] + 1;
}
if (s[x][y] >= 'a' && s[x][y] <= 'z')
{
if (vis2[s[x][y] - 'a'])
continue;
for (pii p : v[s[x][y] - 'a'])
{
int x1 = p.ff;
int y1 = p.ss;
if (vis[x1][y1])
continue;
vis[x1][y1] = 1;
q.push({x1, y1});
dis[x1][y1] = dis[x][y] + 1;
vis2[s[x][y] - 'a'] = 1;
}
}
}
if (!vis[dest.ff][dest.ss])
cout << -1 << en;
else
cout << dis[dest.ff][dest.ss] << en;
return 0;
}
|
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int a[100001],b[100001],n,i,j,k,l;
ll ans;
int main()
{
#ifdef file
freopen("b.in","r",stdin);
#endif
scanf("%d",&n);
fo(i,1,n) scanf("%d",&a[i]);
fo(i,1,n) scanf("%d",&j),ans+=(i&1)?j:a[i],a[i]-=j;
for (i=2; i<=n; i+=2) a[i]=-a[i];
sort(a+1,a+n+1);
fd(i,n,n/2+1) ans+=a[i];
printf("%lld\n",ans);
fclose(stdin);
fclose(stdout);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i <= n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main(){
int N;
cin >> N;
int a[N+10],b[N+10];
rep(i,N) cin >> a[i] >> b[i];
vector<int> tp(2*N),com(2*N, -1);
bool ng = false;
rep(i,N){
if(a[i] != -1){
--a[i];
if(tp[a[i]]) ng = true;
tp[a[i]] = i+1;
}
if(b[i] != -1){
--b[i];
if(tp[b[i]]) ng=true;
tp[b[i]] = -(i+1);
}
if(a[i]!= -1 && b[i] != -1){
com[a[i]] = b[i];
com[b[i]] = a[i];
}
}
if(ng){
cout << "No" << endl;
return 0;
}
vector<bool> dp(2*N+1);
dp[0] = true;
rep(i,2*N){
if(!dp[i]) continue;
for(int j=i+1; j<2*N; j++){
int w = j - i + 1;
if(w%2 == 1) continue;
w /= 2;
bool ok = true;
vector<bool> exist(N+10);
rep(k,w){
int p = i + k;
int q = i + k + w;
if(com[p] != -1 && !(i <= com[p] && com[p] <= j)){
ok = false; //共に-1ではない人が、片方が区間内なのにもう片方がはみ出している
}
if(com[q] != -1 && !(i <= com[q] && com[q] <= j)){
ok = false;
}
bool same = true;
if(tp[p] != 0 && tp[q] != 0){
//p,qが共に-1でない
if(tp[p] <= 0 || tp[p] + tp[q] != 0){
//pは左向きか、pとqが別の人、(qが右向き)
ok = false;
}
}
if(tp[p] < 0 || tp[q] > 0){ //pが左向き、または、qが右向き
ok = false;
}
}
if(ok){
dp[j+1] = true;
}
}
}
if(dp[2*N]) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};
const ll INF = (1ll<<62);
// const ld EPS = 1e-10;
// const ld PI = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;
int main(){
ll N;
cin >> N;
V<ll> A(2*N);
REP(i, 2*N) cin >> A[i];
V<ll> B(2*N), ids(2*N);
iota(ALL(ids), 0);
sort(ALL(ids), [&](ll x, ll y){
return A[x] < A[y];
});
REP(i, 2*N){
if(i < N) B[ids[i]] = 0;
else B[ids[i]] = 1;
}
stack<pll> st;
V<char> res(2*N);
REP(i, 2*N){
if(st.empty()){
st.push(pll{B[i], i});
}else{
auto q = st.top();
if(q.first != B[i]){
res[q.second] = '(';
res[i] = ')';
st.pop();
}else{
st.push(pll{B[i], i});
}
}
}
REP(i, 2*N) cout << res[i];
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define rep(i, n) ;for (int i = 0;i < (int)(n);i++)
#define rep2(i, s, n) ;for (int i = s; i < (int)(n);i++)
#define ALL(vec) (vec).begin(),(vec).end()
#define pi 3.1415926535897932384626433832795
#define MAX_INF 9223372036854775807
#define MIN_INF (9223372036854775807+1)
#define sosuu 1000000007
int main(){
int N;
cin >> N;
rep(i, N){
rep(j, N){
int a=rand()%9;
if(a ==0){
cout << "A";
}
if(a ==1){
cout << "B";
}
if(a ==2){
cout << "C";
}
if(a ==3){
cout << "D";
}
if(a ==4){
cout << "E";
}
if(a ==5){
cout << "F";
}
if(a ==6){
cout << "G";
}
if(a ==7){
cout << "H";
}
if(a ==8){
cout << ".";
}
}
cout << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#define VEC2(TYPE, A, B, NAME, INIT) vector<vector<TYPE>> NAME(A, vector<TYPE>(B, (INIT)))
#define cMOD 1000000007ULL
#define cINF ((1ll<<62)-1)
#define cINFINT ((1<<30)-1)
int main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
//----------------
ull n;
string s,x;
cin >> n>>s>>x;
vector<vector<ll>> dp( n+1, vector<ll>( 0, 0 ) );
dp[n].push_back(0);
vector<ll> a( 0, 0 );
vector<ll> b( 0, 0 );
set<ll> se;
BREP(i,n)
{
ll m = s[i] - '0';
if(x[i] == 'A')
{
a.clear();
b.clear();
for(auto j: dp[i+1])REP(k,7)
{
if((k*10+0)%7==j) a.push_back(k);
if((k*10+m)%7==j) b.push_back(k);
}
sort(ALL(a));
sort(ALL(b));
//REP( j, a.size() ) cout << a[j] << " "; cout << endl;
//REP( j, b.size() ) cout << b[j] << " "; cout << endl;
set_intersection( ALL( a ), ALL( b ), back_inserter( dp[i] ) );
}
else
{
se.clear();
for(auto j: dp[i+1])REP(k,7)
{
if((k*10+0)%7==j) se.emplace(k);
if((k*10+m)%7==j) se.emplace(k);
}
for(auto j: se) dp[i].push_back(j);
}
//REP( j, dp[i].size() ) cout << dp[i][j] << " "; cout << endl;
}
cout <<
(find(ALL(dp[0]), 0)==dp[0].end()
? "Aoki" : "Takahashi") << endl;
//----------------
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<string,int> psi;
typedef pair<int,string> pis;
typedef array<int,2> aii;
typedef array<int,3> aiii;
typedef array<int,4> aiiii;
typedef unsigned long long ull;
typedef long long int ll;
typedef array<ll,2> all;
typedef array<ll,3> alll;
typedef array<ll,4> allll;
#define pb push_back
#define ff first
#define ss second
#define MAX 200005
#define MOD 1000000007
#define INF 1e9+100
vector<aii>adj[MAX];
vector<int> dijkstra_dag_adj[MAX];
int xMove[] = { 0,1,0,-1,1,1,-1,-1, 2, 2, -2, -2, 1, 1, -1, -1 };
int yMove[] = { 1,0,-1,0,1,-1,1,-1, 1, -1, 1, -1, 2, -2, 2, -2 };
int n;
string s,x;
int dp[MAX][8];
int solve(int i, int r)
{
if(i==n)
return r==0?2:1;
if(dp[i][r]!=-1)
return dp[i][r];
int ans=0;
if(x[i]=='A')
{
int cur=solve(i+1,(r*10+s[i]-48)%7);
if(cur!=1)
cur=solve(i+1,(r*10+0)%7);
ans=cur;
}
else
{
int cur=solve(i+1,(r*10+s[i]-48)%7);
if(cur!=2)
cur=solve(i+1,(r*10+0)%7);
ans=cur;
}
return dp[i][r]=ans;
}
int main()
{
//freopen("input.in","r",stdin);
//freopen("output.txt","w",stdout);
cin.tie(0),cout.tie(0);
ios_base::sync_with_stdio(0);
cout.setf(ios::fixed);
cout.precision(10);
int TC=1;
int m,k,q;
//cin>>TC;
for(int t1=1; t1<=TC; t1++)
{
cin>>n>>s>>x;
memset(dp,-1,sizeof dp);
int ans=solve(0,0);
if(ans==1)
cout<<"Aoki\n";
else cout<<"Takahashi\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
ll a[210000];
int main(){
int n;
cin>>n;
rep(i,n) cin>>a[i];
ll base=0;
ll befo=0;
ll MAX=0;
rep(i,n){
base+=befo+a[i];
befo+=a[i];
chmax(MAX,a[i]);
cout<<base+MAX*(i+1)<<endl;
}
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int N;
std::cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++){
std::cin >> A[i];
}
int ans = 0, ans_temp = 0;
int min_a = 0;
for(int i = 0; i < N; i++){
min_a = A[i];
for(int j = i; j < N; j++){
//l = i, r = jとして
if(A[j] < min_a){
//伸ばした先で小さいのがあれば更新
min_a = A[j];
}
ans_temp = min_a * (j - i + 1);
if(ans_temp > ans){
ans = ans_temp;
//std::cout << i << " " << j << " " << ans_temp << "\n";
}
}
}
std::cout << ans;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; (i) < (int64_t)(n); ++(i))
#define REP3(i, m, n) for (int64_t i = (m); (i) < (int64_t)(n); ++(i))
#define REP_R(i, n) for (int64_t i = (int64_t)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int64_t i = (int64_t)(n)-1; (i) >= (int64_t)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;
int64_t solve(int64_t N, int64_t M, const vector<int64_t>& X, const vector<int64_t>& Y, const vector<int64_t>& Z) {
vector<int64_t> dp(1<<N, 0);
dp[0] = 1;
REP(bit, 1<<N){
int64_t m = __builtin_popcountll(bit);
REP(dst, N){
if((bit>>dst)&1) continue;
vector<int64_t> cnt(N, 0);
REP(i, N){
if((bit>>i)&1) cnt[i] += 1;
}
cnt[dst] += 1;
REP(i, N-1){
cnt[i+1] += cnt[i];
}
bool flag = true;
REP(i, M){
if(X[i] < m) continue;
if(cnt[Y[i]] > Z[i]){
flag = false;
break;
}
}
if(flag){
dp[bit|1<<dst] += dp[bit];
}
}
}
return dp[(1<<N)-1];
// TODO: edit here
}
// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
constexpr char endl = '\n';
int64_t N, M;
cin >> N >> M;
vector<int64_t> X(M), Y(M), Z(M);
REP (i, M) { cin >> X[i] >> Y[i] >> Z[i]; X[i]--; Y[i]--; }
int64_t ans = solve(N, M, X, Y, Z);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<array<int, 2>>> A(N + 1);
for (int i = 0; i < M; i++) {
int X, Y, Z;
cin >> X >> Y >> Z;
A[X].push_back({Y, Z});
}
vector<int64_t> dp(1<<N);
dp[0] = 1;
for (int i = 0; i < (1 << N); i++) {
int n = __builtin_popcount(i);
int valid = 1;
for (auto u : A[n]) {
int m = __builtin_popcount(i & ((1 << u[0]) - 1));
if (m > u[1]) {
valid = 0;
break;
}
}
if (valid) {
for (int j = 0; j < N; j++) {
if ((i & (1 << j)) == 0) continue;
dp[i] += dp[i^(1<<j)];
}
}
}
cout << dp[(1<<N) - 1];
} |
/*if ((double) ((double)(clock() - cl)/(double)CLOCKS_PER_SEC)>1.85) {break;}*/
//#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define ft first
#define sc second
#define pb push_back
#define booost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
#define all(x) (x).begin(),(x).end()
#define file(x) freopen(string(string((x)) + ".in").c_str(), "r", stdin); freopen(string(string((x)) + ".out").c_str(), "w", stdout);
#define GG cout << " OPA " << '\n';
using namespace std;
using namespace __gnu_pbds;
typedef pair <int, int> pi;
typedef tree <pair <int, pair <int, int> >, null_type, less<pair <int, pair <int, int> > >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int N = 20 + 5;
const int K = 100;
const int P = 37;
const int INF = 1e12;
const double d_INF = 2000000000.0;
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
const int LOG = 20;
int a[N];
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; i ++) cin >> a[i];
int ans = INF;
for (int mask = 0; mask < (1 << n); mask ++) {
int cur = 0;
int res = 0;
for (int i = 0; i < n; i ++) {
cur |= a[i + 1];
if (((mask >> i) & 1) == 1) res ^= cur, cur = 0;
}
res ^= cur;
cur = 0;
ans = min(ans, res);
}
cout << ans;
}
main () {
int test = 1;
booost;
// cin >> test;
while (test --) {
solve();
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
ll solve(ll n, ll a, ll b)
{
// for 1d
ll nooverlap;
if (n - a - b < 0)
nooverlap = 0;
else
nooverlap = ((n - a - b + 2) * (n - a - b + 1)) % MOD;
ll overlap = ((n - a + 1) * (n - b + 1) - nooverlap) % MOD;
// for 2d
ll overlap2d = (overlap * overlap) % MOD;
ll all = (((n - a + 1) * (n - a + 1) % MOD) * ((n - b + 1) * (n - b + 1) % MOD)) % MOD;
ll ans = ((all - overlap2d) % MOD + MOD) % MOD; // be careful of negative mod
return ans;
}
int main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int t;
cin >> t;
for (int i = 0; i < t; i++)
{
ll n, a, b;
cin >> n >> a >> b;
ll ans = solve(n, a, b);
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
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);
}
#define int long long
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define precise(x) fixed << setprecision(x)
const int MOD = 998244353;
int mod_pow(int a,int b,int M = MOD)
{
int res = 1;
while(b)
{
if(b&1) res=(res*a)%M;
a=(a*a)%M;
b>>=1;
}
return res;
}
const int N = 310;
int ncr[N][N];
int table[N][N];
int psum[N];
const int M = 2e5 + 10;
int b[M];
void solve()
{
for(int i=0;i<N;i++)
{
ncr[i][0] = 1;
for(int j=1;j<=i;j++)
{
ncr[i][j] = (ncr[i-1][j] + ncr[i-1][j-1])%MOD;
}
}
int n,k;
cin >> n >> k;
int a[n];
f(i,n) cin >> a[i];
f(i,n) b[i] = a[i];
for(int i=1;i<=k;i++)
{
f(j,n) psum[i] = (psum[i] + b[j])%MOD;
f(j,n) b[j] = (b[j]*a[j])%MOD;
}
f(i,n) b[i] = a[i];
for(int i=1;i<=k;i++)
{
for(int j=1;j<=k;j++)
{
if(i + j <= k)
{
table[i][j] = (psum[i]*psum[j])%MOD;
table[i][j] -= psum[i+j];
table[i][j]%=MOD;
if(i == j) table[i][j] = (table[i][j]*mod_pow(2,MOD-2))%MOD;
if(table[i][j] < 0) table[i][j]+=MOD;
}
}
}
for(int i=1;i<=k;i++)
{
int res = 0;
res+=(n-1)*psum[i];
res%=MOD;
for(int j=1;j<=i/2;j++)
{
int temp = ncr[i][j];
temp = (temp*table[j][i-j])%MOD;
res+=temp;
res%=MOD;
}
cout << res << '\n';
}
}
signed main()
{
fast;
int t = 1;
// cin >> t;
while(t--)
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define p 998244353
int MOD(int a){
return (a %= p) >= 0 ? a : a + p;
}
int power(int a, int N){
if(N == 0) return 1;
else if(N % 2 == 0) return power(MOD(a * a), N / 2);
else return MOD(a * power(a, N - 1));
}
int inverse(int a){
return power(a, p - 2);
}
int fact(int N){
static vector<int> _fact(1, 1);
for(int i = _fact.size(); i <= N; i++){
_fact.push_back(MOD(i * _fact[i - 1]));
}
return _fact[N];
}
int fact_inv(int N){
static vector<int> inv(2, 1), _fact_inv(2, 1);
for(int i = inv.size(); i <= N; i++){
inv.push_back(MOD(-(p / i) * inv[p % i]));
_fact_inv.push_back(MOD(inv[i] * _fact_inv[i - 1]));
}
return _fact_inv[N];
}
int combination(int N, int k){
if(k < 0 || N < k || N < 0) return 0;
else return MOD(fact(N) * MOD(fact_inv(N - k) * fact_inv(k)));
}
signed main(){
int N, K, i, j;
scanf("%lld%lld", &N, &K);
vector<int> A(N);
for(i = 0; i < N; i++){
scanf("%lld", &A[i]);
}
vector<int> S(K + 1, 0);
for(i = 0; i < N; i++){
int a = 1;
for(j = 0; j <= K; j++){
S[j] = MOD(S[j] + a);
a = MOD(a * A[i]);
}
}
for(i = 1; i <= K; i++){
int sub = 0;
for(j = 0; j <= i; j++){
sub = MOD(sub + combination(i, j) * MOD(S[i - j] * S[j]));
}
int ans = MOD(MOD(sub - power(2, i) * S[i]) * inverse(2));
printf("%lld\n", ans);
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
const int mod = 1'000'000'007;
//=======================
void solve() {
int i, j, n, m;
cin>>n;
vi v(n);
int sum=0;
fo(i,n)
cin>>v[i];
fo(i,n)
{if(v[i]>10)
sum+=v[i]-10;
}
cout<<sum;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
// cin >> t;
while(t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define all(V) V.begin(),V.end()
#define pi 3.1415926535897932384626
#define fi fixed<<setprecision(13)
#define MOD 1000000007
#define ll long long
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define Rep(i, n) for (ll i = 1; i <=(ll)(n); i++)
#define reps(i,k,n) for (ll i = (ll)k; i < (ll)(n); i++)
using namespace std;
template<class T> void chmin(T& a,T b){ if(a > b) a=b; }
template<class T> void chmax(T& a,T b){ if(a < b) a=b; }
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){fill( (T*)array, (T*)(array+N), val );}
ll nck(ll a,ll b){
ll s=1,x=1;
rep(i,b) s=(s*(a-i))/x,x++;
return s;
}
const ll infll=1LL<<62;
const ll inf=1<<30;
int main(){
string s;cin>>s;
int c=0;
rep(i,9){
if(s[i]=='Z'&&s[i+1]=='O'&&s[i+2]=='N'&&s[i+3]=='e') c++;
}
cout<<c;
}
/*制約を確認しろllじゃなくて大丈夫か？*/
|
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
std::unordered_map<int, int> mx;
std::unordered_map<int, int> mn;
rep(i, N)
{
int x, c;
cin >> x >> c;
if (mx.find(c) != mx.end())
{
mx[c] = std::max(mx[c], x);
mn[c] = std::min(mn[c], x);
}
else
{
mx[c] = x;
mn[c] = x;
}
}
long long time1 = 0;
long long time2 = 0;
int pos1 = 0;
int pos2 = 0;
for (int i = 1; i <= N; i++)
{
if (mx.find(i) != mx.end())
{
long long diff = std::abs(mx[i] - mn[i]);
long long tmp1 = time1;
long long tmp2 = time2;
// from pos1, mx -> mn
tmp1 += std::abs(pos1 - mx[i]) + diff;
// from pos2, mx -> mn
tmp2 += std::abs(pos2 - mx[i]) + diff;
long long tmp3 = time1;
long long tmp4 = time2;
// from pos1, mn -> mx
tmp3 += std::abs(pos1 - mn[i]) + diff;
// from pos2, mn -> mx
tmp4 += std::abs(pos2 - mn[i]) + diff;
time1 = std::min(tmp1, tmp2);
time2 = std::min(tmp3, tmp4);
pos1 = mn[i];
pos2 = mx[i];
}
}
time1 += std::abs(pos1);
time2 += std::abs(pos2);
cout << std::min(time1, time2) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(int i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n; cin >> n;
ll x[n], c[n]; zep(i, 0, n)cin >> x[i] >> c[i];
map<ll, P> mp;
zep(i, 0, n){
if(mp.find(c[i]) == mp.end()){
mp[c[i]] = P(x[i], x[i]);
}
mp[c[i]] = P(min(mp[c[i]].first, x[i]), max(mp[c[i]].second, x[i]));
}
ll m = mp.size();
ll dp[m + 1][2]; memset(dp, 0, sizeof(dp));
ll l = 0, r = 0;
ll at = 0;
for(auto it = mp.begin(); it != mp.end(); it++){
ll L = (*it).second.first, R = (*it).second.second;
dp[at + 1][0] = INF;
dp[at + 1][1] = INF;
if(R < l){
dp[at + 1][0] = min(dp[at + 1][0], l - L + dp[at][0]);
}else{
dp[at + 1][0] = min(dp[at + 1][0], 2 * R - l - L + dp[at][0]);
}
if(R < r){
dp[at + 1][0] = min(dp[at + 1][0], r - L + dp[at][1]);
}else{
dp[at + 1][0] = min(dp[at + 1][0], 2 * R - r - L + dp[at][1]);
}
if(L < l){
dp[at + 1][1] = min(dp[at + 1][1], R + l - 2 * L + dp[at][0]);
}else{
dp[at + 1][1] = min(dp[at + 1][1], R - l + dp[at][0]);
}
if(L < r){
dp[at + 1][1] = min(dp[at + 1][1], R + r - 2 * L + dp[at][1]);
}else{
dp[at + 1][1] = min(dp[at + 1][1], R - r + dp[at][1]);
}
l = L, r = R;
at++;
//cout << dp[at][0] << " " << dp[at][1] << endl;
}
print(min(dp[m][0] + abs(l), dp[m][1] + abs(r)))
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define visit asdf
const int N=4e5+5;
const int M=4e5+5;
int n,m,ans;
int a[N],b[N];
int indeg[M];
vector<int> v[M];
bool visit[N];
queue<int> q;
int match(int x)
{
for(int i=0;i<v[x].size();i++)
if(!visit[v[x][i]]) return v[x][i];
return 4e5+1;
}
int main()
{
cin>>n; m=4e5;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
indeg[a[i]]++; v[a[i]].pb(i);
indeg[b[i]]++; v[b[i]].pb(i);
}
for(int i=1;i<=n;i++)
if(indeg[a[i]]==1 || indeg[b[i]]==1) q.push(i),visit[i]=1;
for(int i=1;i<=m;i++)
if(indeg[i]) ans++;
while(!q.empty())
{
int x=q.front(); q.pop();
if(indeg[a[x]]==1 && indeg[b[x]]==1) ans--;
if(indeg[a[x]]==1) if(--indeg[b[x]]==1) q.push(match(b[x])),visit[match(b[x])]=1;
if(indeg[b[x]]==1) if(--indeg[a[x]]==1) q.push(match(a[x])),visit[match(a[x])]=1;
}
cout<<ans<<'\n';
return 0;
} | #include <bits/stdc++.h>
//#include <atcoder/all>
#ifndef LOCAL
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI = acos(-1.0);
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
map<ll, vector<pair<ll, ll>>> m;
vector<vector<ll>> graph;
vector<ll> ans;
map<ll, ll> dfs(ll i, ll depth) {
map<ll, ll> ret;
for (auto j : graph[i]) {
auto x = dfs(j, depth + 1);
if (ret.size() < x.size()) {
ret.swap(x);
}
for (auto [k, v] : x) {
ret[k] += v;
}
}
ret[depth]++;
for (auto [num, d] : m[i]) {
ans[num] = ret[d];
}
return (ret);
}
void solve(long long N, std::vector<long long> P, long long Q, std::vector<long long> U, std::vector<long long> D) {
ans.resize(Q);
REP(i, Q) {
m[U[i]].push_back(make_pair(i, D[i]));
}
graph.resize(N);
FOR(i, 1, N) {
graph[P[i - 1]].push_back(i);
}
dfs(0, 0);
REP(i, Q) {
cout << ans[i] << endl;
}
}
int main() {
long long N;
std::scanf("%lld", &N);
std::vector<long long> P(N - 2 + 1);
for (int i = 0; i < N - 2 + 1; i++) {
std::scanf("%lld", &P[i]);
P[i]--;
}
long long Q;
std::scanf("%lld", &Q);
std::vector<long long> U(Q);
std::vector<long long> D(Q);
for (int i = 0; i < Q; i++) {
std::scanf("%lld", &U[i]);
std::scanf("%lld", &D[i]);
U[i]--;
}
solve(N, std::move(P), Q, std::move(U), std::move(D));
return 0;
}
|
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb emplace_back
#define mp make_pair
#define sqr(n) ((n)*(n))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define precision(a) setiosflags(ios::fixed) << setprecision(a)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<long long> VL;
typedef double db;
template <typename T> inline char read(T &x) {
x = 0; T fg = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') fg = -1;ch = getchar();}
while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ '0'), ch = getchar();
x = fg * x; return ch;
}
template <typename T, typename... Args> inline void read(T &x, Args &... args) { read(x), read(args...); }
template <typename T> inline void write(T x) {
int len = 0; char c[21]; if (x < 0) putchar('-'), x = -x;
do{++len; c[len] = x % 10 + '0';} while (x /= 10);
for (int i = len; i >= 1; i--) putchar(c[i]);
}
template <typename T, typename... Args> inline void write(T& x, Args &... args) { write(x), write(args...); }
template<class T1, class T2> bool umin(T1& a, T2 b) { return a > b ? (a = b, true) : false; }
template<class T1, class T2> bool umax(T1& a, T2 b) { return a < b ? (a = b, true) : false; }
template<class T> void clear(T& a) { T().swap(a); }
const int N = 1e6 + 5;
int n, m, _, q, cas;
int x[N], y[N];
PII e[N];
bool v[55];
int main() {
IOS; cin >> n >> m >> q;
rep (i, 1, n) cin >> e[i].fi >> e[i].se;
sort(e + 1, e + 1 + n, [](PII& a, PII& b) { return a.se > b.se; });
rep (i, 1, m) cin >> x[i];
while (q--) {
int l, r, cnt = 0, ans = 0; cin >> l >> r;
rep (i, 1, l - 1) y[++cnt] = x[i];
rep (i, r + 1, m) y[++cnt] = x[i];
sort(y + 1, y + 1 + cnt); memset(v, 0, sizeof v);
rep (i ,1, n) rep (j, 1, cnt) if (y[j] >= e[i].fi && !v[j]) {
v[j] = 1; ans += e[i].se; break;
}
cout << ans << '\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=5e5+20;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=10500000;
int r,c,a,b;
map<vector<int>,int> m1;
int dp[(1<<16)][20][20],dp2[(1<<16)][20][20];
void num(int one,int two,int prev,int mask,int pos)
{ if(pos==r)
{
vector<int> v;
v={one,two,mask};
m1[v]++;
//cout<<one<<" "<<two<<" "<<mask<<"\n";
return;
}
int arr[2];
arr[0]=((prev&(1<<pos))!=0);
if(pos+1<r)
{
arr[1]=((prev&(1<<(pos+1)))!=0);
if(arr[0]==0 && arr[1]==0)
{
num(one+1,two,prev,mask+(1<<pos),pos+1);
//num(one+2,two,prev,mask+(1<<pos)+(1<<(pos+1)),pos+1);
num(one,two+1,prev,mask,pos+2);
}
else if(arr[0]==1 && arr[1]==1)
{
num(one-1,two+1,prev,mask,pos+1);
//num(one-2,two+2,prev,mask,pos+2);
num(one,two+1,prev,mask,pos+2);
num(one+1,two,prev,mask+(1<<pos),pos+1);
//num(one+2,two,prev,mask+(1<<pos)+(1<<(pos+1)),pos+2);
}
else if(arr[0]==1 && arr[1]==0)
{
num(one-1,two+1,prev,mask,pos+1);
num(one,two+1,prev,mask,pos+2);
num(one+1,two,prev,mask+(1<<pos),pos+1);
}
else
{
num(one+1,two,prev,mask+(1<<pos),pos+1);
num(one,two+1,prev,mask,pos+2);
}
}
else
{
if(arr[0]==0)
{
num(one+1,two,prev,mask+(1<<pos),pos+1);
}
else
{
num(one+1,two,prev,mask+(1<<pos),pos+1);
num(one-1,two+1,prev,mask,pos+1);
}
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
//long long tt = clock();
#endif
ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
int i,j,k,l,l1;
cin>>r>>c>>b>>a;
dp[0][0][0]=1;
for(i=0;i<c;++i)
{for(l1=0;l1<(1<<r);++l1)
{
for(j=0;j<=(r*c);++j)
for(k=0;k<=(r*c);++k)
dp2[l1][j][k]=0;
}
for(j=0;j<(1<<r);++j)
{ m1.clear();
if(c==1)
if(j!=0)
continue;
num(0,0,j,0,0);
for(k=0;k<=(r*c);++k)
{
for(l=0;l<=(r*c);++l)
{
for(auto x:m1)
{
vector<int> v2=x.first;
if(k+v2[0]>=0 && l+v2[1]>=0)
{
dp2[v2[2]][k+v2[0]][l+v2[1]]+=dp[j][k][l]*x.second;
/*if(i==1 && v2[0]==2 && v2[1]==0 && j==3 && k==2 && l==0)
cout<<k<<" "<<l<<"\n";*/
}
}
}
}
}
for(j=0;j<(1<<r);++j)
{
for(k=0;k<=r*c;++k)
{
for(l=0;l<=(r*c);++l)
{dp[j][k][l]=dp2[j][k][l];
}
}
}
}
int ans=0;
for(j=0;j<(1<<r);++j)
{
ans+=dp[j][a][b];
}
cout<<ans;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll powermd(ll x, int y, ll p)
{
ll res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
// if (x == 0) return 0; // In case x is divisible by p;
while (y > 0)
{
// If y is odd, multiply x with result
if (y & 1)
res = (res*x) % p;
// y must be even now
y = y>>1; // y = y/2
x = (x*x) % p;
}
return res;
}
void solve(){
ll n,p;
cin>>n>>p;
cout<<(powermd(p-2,n-1,1000000007)*(p-1))%1000000007;
}
int main(){
int t;
t=1;
while(t--) {
solve();
}
} | #include <bits/stdc++.h>
#define endl '\n'
using namespace std;
int N, K;
int dp[3005][3005];
const int mod = 998244353;
int f(int n, int k) {
if(n < k) return 0;
if(k == 0) return (n == 0);
if(~dp[n][k]) return dp[n][k];
int ret = 0;
ret += f(n - 1, k - 1);
ret %= mod;
ret += f(n, 2 * k);
ret %= mod;
return dp[n][k] = ret;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
memset(dp, -1, sizeof(dp));
cin >> N >> K;
cout << f(N, K) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,seki,goukei;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A.at(i);
}
vector<int> B(n);
for (int i = 0; i < n; i++) {
cin >> B.at(i);
}
goukei = 0;
for (int i = 0; i < n; i++) {
seki = A.at(i) * B.at(i);
goukei = goukei + seki;
}
if (goukei == 0) {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
}
| /*
@uthor: Amit Kumar
user -->GitHub: drviruses ; CodeChef: dr_virus_ ; Codeforces,AtCoder,Hackerearth,Hakerrank: dr_virus;
*/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#define ln mp::cpp_int;
#define int long long
#define double long double
#define uint unsigned long long
#define all(vec) vec.begin(),vec.end()
#define endl "\n"
int google_itr = 1;
#define google(x) cout<<"Case #"<<x<<": "
#define pi 3.14159265358979323846264338327950L
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void debug_out(
vector<string> __attribute__ ((unused)) args,
__attribute__ ((unused)) int idx,
__attribute__ ((unused)) int LINE_NUM) { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(vector<string> args, int idx, int LINE_NUM, Head H, Tail... T) {
if(idx > 0) cerr << ", "; else cerr << "Line(" << LINE_NUM << ") ";
stringstream ss; ss << H;
cerr << args[idx] << " = " << ss.str();
debug_out(args, idx + 1, LINE_NUM, T...);
}
#define XOX
#ifdef XOX
#define deb(...) debug_out(vec_splitter(#__VA_ARGS__), 0, __LINE__, __VA_ARGS__)
#else
#define deb(...) 42
#endif
const int mod = 1e9+7;
const int inf = 1e18;
void virus(){
int n;
cin >> n;
vector <int> a(n), b(n);
for(auto &i:a) cin >> i;
for(auto &i:b) cin >> i;
int ans = 0;
for(auto i=0; i<n; i++) ans += (a[i]*b[i]);
cout << ((ans == 0)? "Yes" : "No") << endl;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int t = 1;
//cin >> t;
while(t--){
auto start = system_clock::now();
virus();
auto stop = system_clock::now();
duration<double> duration = (stop - start);
//cerr << "\nTime: "<< fixed << setprecision(10) << (double)duration.count() <<"sec"<< endl;
//your code goes here
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif
#define mp make_pair
#define pb push_back
#define sz(x) (int)((x).size())
#define ms(x, v) memset((x), v, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define REP(x, n) for(int x = 0; x < n; x++)
#define REPV(x, v, n) for(int x = v; x < n; x++)
#define REVE(x, n) for(int x = n; x >= 0; x--)
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vvi = vector<vi>;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vii p(N);
for(auto &x : p) cin >> x.first >> x.second;
bool ok = false;
REP(i, N)
REPV(j, i + 1, N)
REPV(k, j + 1, N)
{
vii tmp({p[i], p[j], p[k]});
sort(all(tmp));
ll m1 = (tmp[2].second - tmp[1].second) * 1LL * (tmp[1].first - tmp[0].first);
ll m2 = (tmp[1].second - tmp[0].second) * 1LL * (tmp[2].first - tmp[1].first);
if((ok = m1 == m2)) goto en;
}
en:;
if(ok) cout << "Yes\n";
else cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define inv(n, a) for(int i = 0; i < n; i++) cin >> a[i]
#define MOD 1000000007
#define INF 1e7
#define LINF 1e15
typedef long long ll;
typedef long double ld;
using Graph = vector<vector<int>>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
rep(i, n){
cin >> x[i] >> y[i];
}
for(int i = 0; i < n - 2; i++){
for(int j = 1; j < n - 1; j++){
for(int k = 2; k < n; k++){
if (i == j || j == k || k == i)
continue;
if ((y[j] - y[i]) * (x[k] - x[i]) == (y[k] - y[i]) * (x[j] - x[i])){
cout << "Yes" << endl;
return (0);
}
}
}
}
cout << "No" << endl;
}
|
using namespace std;
#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF 1000000000
#define N 1010
int n,m=7;
char t[N]="atcoder";
char s[N];
int main(){
// freopen("in.txt","r",stdin);
int Q;
scanf("%d",&Q);
while (Q--){
scanf("%s",s);
n=strlen(s);
int c=0,ans=INF;
bool BZ=1;
for (int i=0;i<m && BZ;++i){
for (int j=i;j<n;++j)
if (s[j]>t[i]){
ans=min(ans,c+j-i);
break;
}
bool bz=0;
for (int j=i;j<n;++j)
if (s[j]==t[i]){
c+=j-i;
for (;j>i;--j)
swap(s[j],s[j-1]);
bz=1;
break;
}
// bz=(s[i]==t[i]);
if (bz==0){
BZ=0;
break;
}
}
if (BZ && n>m)
ans=min(ans,c);
printf("%d\n",ans==INF?-1:ans);
}
return 0;
} | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cctype>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
const int INF = 1 << 30;
const string ac = "atcoder";
int solve(string s) {
int len = s.length();
if (s > ac) {
return 0;
}
for (int i = 1; i < len; ++i) {
if (s[i] != 'a') {
return i - (s[i] > 't');
}
}
return -1;
}
int main() {
int T;
cin >> T;
for (int t = 0; t < T; ++t) {
string s;
cin >> s;
int ans = solve(s);
cout << ans << endl;
}
return 0;
}
|
/*** keep hungry and calm CoolGuang! ***/
//#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define all(s) s.begin(),s.end()
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll INF= 1e16+7;
const int maxn = 1e6+700;
const int mod= 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
ll n,m;
int prime[maxn],vis[maxn];
int cnt = 0;
ll fac[maxn];
ll qpow(ll a,ll b)
{
ll ans=1;
while(b){
if(b&1)ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}return ans;
}
ll cal(int m,int n)
{
if(m<n) return 0;
return fac[m]*qpow(fac[m-n],mod-2)%mod*qpow(fac[n],mod-2)%mod;
}
int mx[maxn];
map<ll,int>mp;
void SetPrime(){
for(int i=2;i<=200000;i++){
if(!vis[i]){
prime[++cnt] = i;
mx[i] = i;
for(int k=i*2;k<=200000;k+=i){
vis[k] = 1;
mx[k] = i;
}
}
}
}
int main(){
SetPrime();
fac[0] = 1;
for(int i=1;i<=500000;i++) fac[i] = (fac[i-1]*i)%mod;
read(n);read(m);
ll ans = 0;
for(int i=1;i<=m;i++){
ll tmp = i,res = 1,pre = mx[tmp],c = 0;
while(tmp != 1){
if(mx[tmp]!=pre){
res = (res * cal(n+c-1,c))%mod;
c = 1;
}else c++;
pre = mx[tmp];
tmp /= mx[tmp];
}
res = (res * cal(n+c-1,c))%mod;
ans = (ans + res)%mod;
}
dl(ans);
return 0;
}
/***
***/ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <long long, long long> pll;
ll mod = 998244353;
ll dp[200001][18];
void countWays(ll n, ll m)
{
for (int i = 0; i <= n; i++) {
dp[1][i] = 1;
}
ll sum;
for (int i = 2; i <= m; i++) {
for (int j = 0; j <= n; j++) {
sum = 0;
for (int k = 0; k <= j; k++) {
sum += dp[i - 1][k], sum %= mod;
}
dp[i][j] = sum;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
countWays(17, n);
ll bn = 1;
for (int i = 2; i <= m; i++){
ll brp = 0;
ll tbn = 1;
ll t = i;
for (int j = 2; j <= sqrt(i); j++){
ll btr = 0;
while (t%j == 0)
btr++, t/=j;
if (btr > 0)
tbn *= dp[n][btr], tbn %= mod;
}
if (t > 1)
tbn *= n, tbn %= mod;
bn += tbn, bn%= mod;
}
//cout << dp[n][2] << endl;
cout << bn;
}
|
//kyoprosaikoooooooooooo!!
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
//素数判定 O(√N)
ll prime (ll abc) {
if (abc < 2) {
return 0;
}
else if (abc == 2) {
return 1;
}
else if (abc % 2 == 0) {
return 0;
}
double sqrtabc = sqrt(abc);
for (int i = 3; i <= sqrtabc; i++) {
if (abc % i == 0) {
return 0;
}
}
return 1;
}
//素因数分解(約数列挙) O(√N)
vector<ll> divisor(ll n) {
vector<long long> ret;
for (long long 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;
}
//最大公約数
ll gcd(ll x,ll y){
if(x<y) swap(x,y);
ll r;
while(y>0){
r=x%y;
x=y;
y=r;
}
return x;
}
//最小公倍数
ll lcm(ll x,ll y){
return (ll)(x/gcd(x,y))*y;
}
int main() {
int N, D, H;
cin >> N >> D >> H;
vector<vector<double>> S(N, vector<double>(2));
for (int i = 0; i < N; i++) {
for (int j = 0; j < 2; j++) {
cin >> S.at(i).at(j);
}
}
double ans = 0;
for (int i = 0; i < N; i++) {
double X = H + (S.at(i).at(1) - H) * D / (D - S.at(i).at(0));
ans = max(X, ans);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using ll =long long;
using namespace std;
using Graph =vector<vector<ll> >;
int main(){
int X,Y,Z;
cin>>X>>Y>>Z;
int ans=0;
for(int p=0;p<10000000;p++){
if(p*X>=Y*Z){
ans=p;
break;
}
}
ans--;
cout<<ans<<endl;
}
|
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);
ll mod_pow(ll x, ll n, ll m = mod) {
if (n < 0) {
ll res = mod_pow(x, -n, m);
return mod_pow(res, m - 2, m);
}
if (abs(x) >= m)x %= m;
if (x < 0)x += m;
ll res = 1;
while (n) {
if (n & 1)res = res * x % m;
x = x * x % m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n % mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
if (n == 0)return modint(1);
modint res = (a * a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 22;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[a - b];
}
void solve() {
int n; cin >> n;
cout << n - 1 << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(10);
//init_f();
//init();
//expr();
//int t; cin >> t; rep(i, t)
solve();
return 0;
} | #include<bits/stdc++.h>
#define MAXN 400005
typedef long long ll;
using namespace std;
int n;
ll a[MAXN] , ans , mod = 1e9 + 7;
ll f[MAXN][2];
ll val[MAXN];
int main(){
cin>>n;for(int i = 1 ; i <= n ; i++)cin>>a[i];
f[0][1] = 1;
f[1][0] = f[1][1] = 1;
for(int i = 2 ; i <= n ; i++){
f[i][0] = (f[i - 1][1]) % mod;
f[i][1] = (f[i - 1][0] + f[i - 1][1]) % mod;
}
for(int i = 1 ; i <= n ; i++){
val[i] = (((f[i - 1][1] * f[n - i + 1][1]) % mod - (f[i - 1][0] * f[n - i + 1][0]) % mod) % mod + mod) % mod;
}
for(int i = 1 ; i <= n ; i++){
ans = (ans + (val[i] * a[i]) % mod) % mod;
}
cout<<ans<<endl;
}
/*
³¤¶ÈΪi£¬ÒÔ+/- ½áβ
val[i] = f[i - 1][1] * f[n - i + 1][1] -
*/ |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
void read(int &x){
static char c;
while(!isdigit(c=getchar())); x=c^48;
while(isdigit(c=getchar()))x=(x*10)+(c^48);
}
void read(ll &x){
static char c;
while(!isdigit(c=getchar())); x=c^48;
while(isdigit(c=getchar()))x=(x*10)+(c^48);
}
void chkmax(int &x,int y){if(y>x)x=y;}
void chkmin(int &x,int y){if(y<x)x=y;}
void chkmax(ll &x,ll y){if(y>x)x=y;}
void chkmin(ll &x,ll y){if(y<x)x=y;}
int n;
int A[10],tot;
void Work(){
read(n);
while(n&&n%10==0) n/=10;
while(n) A[++tot]=n%10,n/=10;
for(int i=1;i<=tot/2;++i)
if(A[i]!=A[tot-i+1]) return puts("No"),void();
puts("Yes");
}
int main(){Work();}
| #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using Graph = vector<vector<int>>;
using vst= vector<string>;
using vin= vector<int>;
using ll=long long;
using ull=unsigned long long;
using vll= vector<ll>;
using P=pair<int ,int>;
using pqi=priority_queue<int, vector<int>, greater<int>>;
using pqp=priority_queue<P, vector<P>, greater<P>>;
//const long double pi=acos(-1);
#define ft first
#define sd second
#define fn front
#define pb push_back
#define eb emplace_back
#define it insert
#define vvi vector<vector<int>>
#define si(v) int((v).size())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rell(i,n) for (ll i=0; i< (ll)(n); i++)
#define sot(x) sort(x.begin(), x.end())
#define rese(x) reverse(x.begin(), x.end())
#define gsot(x) sort(x.begin(), x.end(), greater<ll>());
#define vnn(x,y,s,name) vector<vector<int>> name(x, vector<int>(y,s))
#define mse(x) memset(x, 0, sizeof(x)
#define all(x) (x).begin(),(x).end()
#define mii(x,y,z) min(x,min(y,z))
#define maa(x,y,z) max(x,max(y,z))
#define cps CLOCKS_PER_SEC
#define yes cout<<"Yes"<<"\n"
#define no cout<<"No"<<"\n"
#define cset(x) cout<<fixed<<setprecision(x)
const ll INF=(1e18)+(1e17);
const ll ma=(1e18)+100;
//const int INF=1001001001;
//998244353 1000000007
int f(string &x){
int d=1;
for(auto c:x){
if(d<c-'0') d=c-'0';
}
return d;
}
ll g(string &x, ll a){
ll ans=0;
rep(i,x.size()){
if((ans)>(ma/a)) return INF;
ans*=a;
ans+=(x[i]-'0');
if(ans>=ma) return INF;
}
return ans;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string x;
ll m;
cin>>x>>m;
ll d=f(x);
//cout<<g(x,6)<<endl;
//cout<<d<<endl;
//cout<<g(x,d+1)<<endl;
if(g(x,d+1)>m){
cout<<0<<endl;
return 0;
}
if(x.size()==1){
cout<<1<<endl;
return 0;
}
ll ok=d+1,ng=m;
while(ng-ok>1){
ll mid=(ok+ng)/2;
if(g(x,mid)>m) ng=mid;
else ok=mid;
}
if(x=="10") cout<<m-1<<endl;
else cout<<ok-d<<endl;
}
|
#include <bits/stdc++.h>
#define MAX 10000
using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef double ld;
const int N=1e5+5;
ll a[N];
list<ll>diff;
/*
void prints(vector<pair<ll,ll>>v,ll n){
cout<<"after sorting the elements"<<endl;
for(int i=0;i<n;i++)
cout<<v[i].first<<" "<<v[i].second<<endl;
return ;
}
*/
int main()
{
IOS;
ll t,cnt=0;
cin>>t;
vector<pair<ll,ll>>v(t);
for(int i=0;i<t;i++){
cin>>v[i].first>>v[i].second;
}
sort(v.begin(),v.end());
for(int i=0;i<t-1;i++)
{
ll f1 = v[i].first;
ll g1 = v[i].second;
for(int j=i+1;j<t;j++)
{
ll f2 = v[j].first;
ll g2 = v[j].second;
// cout<<"("<<f1<<"."<<g1<<")"<<" "<<"("<<f2<<"."<<g2<<")"<<endl;
double upper ,lower;
upper = (g2-g1);
lower = (f2-f1);
double dist = double(upper/lower);
// cout<<upper<<" ? "<<lower<<" ? "<<dist<<endl;
if( dist >= -1 && dist <= 1)
cnt++;
}
}
cout<<cnt<<endl;
return 0;
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long N; cin >> N;
vector<long long> X(N), C(N);
for (int i = 0; i < N; i++) cin >> X[i] >> C[i];
priority_queue<long long> Que[200020];
for (int i = 0; i < N; i++) {
Que[C[i] - 1].push(X[i]);
}
long long min_dp = 0;
long long max_dp = 0;
long long min_dp_num = 0;
long long max_dp_num = 0;
for (int i = 0; i < N; i++) {
if (Que[i].empty()) continue;
long long min_ = 1LL << 60;
long long max_ = 0 - (1LL << 60);
while (!Que[i].empty()) {
long long a = Que[i].top();
Que[i].pop();
min_ = min(min_, a);
max_ = max(max_, a);
}
long long p;
if (max_ < min_dp_num) p = min_dp + (min_dp_num - min_);
else p = min_dp + (max_ - min_dp_num) + (max_ - min_);
long long q;
if (max_ < max_dp_num) q = max_dp + (max_dp_num - min_);
else q = max_dp + (max_ - max_dp_num) + (max_ - min_);
long long r;
if (min_ > min_dp_num) r = min_dp + (max_ - min_dp_num);
else r = min_dp + (min_dp_num - min_) + (max_ - min_);
long long s;
if (min_ > max_dp_num) s = max_dp + (max_ - max_dp_num);
else s = max_dp + (max_dp_num - min_) + (max_ - min_);
min_dp = min(p, q);
max_dp = min(r, s);
min_dp_num = min_;
max_dp_num = max_;
}
min_dp = min_dp + abs(min_dp_num);
max_dp = max_dp + abs(max_dp_num);
cout << min(min_dp, max_dp) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No cout << "No" << endl;
#define INF INT_MAX
#define MOD 1000000007
#define PI acos(-1)
using ll = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K, M;
cin >> N >> K >> M;
ll sum = 0;
rep (i, N-1) {
ll A;
cin >> A;
sum += A;
}
if (N*M-sum <= K) {
if (N*M-sum >= 0) {
cout << N*M-sum << endl;
} else {
cout << 0 << endl;
}
} else {
cout << -1 << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <utility>
using namespace std;
namespace {
using Integer = long long; //__int128;
template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
template<class T> istream& operator , (istream& is, T& val){ return is >> val;}
template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
template<class T> ostream& operator , (ostream& os, const T& val){ return os << " " << val;}
template<class H> void print(const H& head){ cout << head; }
template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }
template<class H> void eprint(const H& head){ cerr << head; }
template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }
class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator end(){ return range_iterator( end_, step_); } };
inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }
inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed
mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());
template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }
inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;
int main(){
int a,b;
cin >> a,b;
for(int x=-100; x<=100; x++)
for(int y=-100; y<=100; y++)
if(x+y == a && x-y == b){
println(x, y);
return 0;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
int a,b,c,d;
cin >> a >>b;
cin >> c >> d;
cout << b-c;
} | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 998244353
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
using namespace std;
struct RandGen{
ll x,y,z;
ll nextInt()
{
ll t=x^(x<<11);
x=y;
y=z;
z^=(z>>19)^t^(t>>8);
return x;
}
ll random(ll M)
{
return nextInt()%M;
}
}rng;
int main(){
rng.x=89327;
rng.y=2579;
rng.z=67239;
ll t=1000;
while(t--)
{
ll x,y,a,b,nxt;
cin>>x>>y>>a>>b;
while(abs(a-x)+abs(b-y)>0)
{
nxt=rng.random(abs(a-x)+abs(b-y));
if(nxt<abs(a-x))
{
if(x>a)
{
putchar('U');
x--;
}
else
{
putchar('D');
x++;
}
}
else
{
if(y<b)
{
putchar('R');
y++;
}
else
{
putchar('L');
y--;
}
}
}
puts("");
fflush(stdout);
ll d;
cin>>d;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long double x, y, r;
cin >> x >> y >> r;
r = nextafter(r, 1001001001001001001LL);
long long answer = 0LL;
for (long long i = ceil(x - r); i <= floor(x + r); i++) {
long double a = r * r - (i - x) * (i - x);
answer += floor(y + sqrtl(a)) - ceil(y - sqrtl(a)) + 1LL;
}
cout << answer;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
std::vector<std::string> split(const std::string &s, const std::string &delimiter) {
std::vector<std::string> res;
int pos = 0;
while (true) {
int del_pos = s.find(delimiter, pos);
if (del_pos == s.npos) break;
res.emplace_back(s.substr(pos, del_pos - pos));
pos = del_pos + delimiter.length();
}
res.emplace_back(s.substr(pos));
return res;
}
constexpr int L = 10000;
int format(string s) {
vector<string> v = split(s, ".");
int x = stoi(v[0]) * L;
if (v.size() == 1) return x;
while (v[1].length() < 4) v[1] += '0';
return x + stoi(v[1]);
}
ll ceilL(ll x) {
return x >= 0 ? (x + L - 1) / L * L : x / L * L;
}
int main() {
string xs, ys, rs; cin >> xs >> ys >> rs;
ll x = format(xs), y = format(ys), r = format(rs);
ll ans = 0;
for (ll h = ceilL(y - r); h <= y + r; h += L) {
ll l = x - r - 1;
{
ll ub = x;
while (ub - l > 1) {
ll mid = (l + ub) >> 1;
((y - h) * (y - h) + (x - mid) * (x - mid) <= r * r ? ub : l) = mid;
}
++l;
}
ll ri = x + r + 1;
{
ll lb = x;
while (ri - lb > 1) {
ll mid = (lb + ri) >> 1;
((y - h) * (y - h) + (mid - x) * (mid - x) <= r * r ? lb : ri) = mid;
}
--ri;
}
// cout << h << ' ' << l << ' ' << r << '\n';
l = ceilL(l);
if (l <= ri) ans += (ri - l) / L + 1;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,s,n) for(int i=s;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegain(),(x).rend()
const int INF=1e9;
using namespace std;
using ll = long long;
typedef pair<int,int> P;
int main(){
string s;
cin>>s;
int n=s.size();
reverse(all(s));
rep(i,0,n){
if(s[i]=='6') s[i]='9';
else if(s[i]=='9') s[i]='6';
}
cout<<s;
} | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=(ll)1<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
int main(){
string s;
cin>>s;
auto f=[&](char c){
if(c=='0')return '0';
if(c=='1')return '1';
if(c=='6')return '9';
if(c=='8')return '8';
if(c=='9')return '6';
};
rep(i,s.size()){
s[i]=f(s[i]);
}
reverse(all(s));
out(s);
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+100;
#define ll long long
int K; ll f[N],ans;
int main() {
cin>>K;
for(int i=1;i<=K;++i)
for(int j=i;j<=K;j+=i)
++f[j];
for(int i=1;i<=K;++i) f[i] += f[i-1];
for(int i=1;i<=K;++i) ans += f[K/i];
cout<<ans<<endl; return 0;
} | /*************************************************************************
> File Name: solve.cpp
> Author: liupo
> Mail: [email protected]
> Created Time: 2021-02-21 20:21:34
************************************************************************/
#define GOODOJ
#define SYNC 0
#ifdef GOODOJ
#include <bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#include <chrono>
#include <random>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#else
#include <iostream>
#include <cstdio>
#include <cmath>
#include <set>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <deque>
#include <vector>
#include <limits>
#include <cassert>
#include <sstream>
#include <iterator>
#include <functional>
#endif
using namespace std;
#define endl '\n'
#define fep(i,b,e) for(int i=(b);i<int(e);++i)
#define rep(i,x) for(int i=0;i<int(x);++i)
#define rap(i,x) for(auto& i : (x))
#define seg(t) (t).begin(), (t).end()
#define ep emplace_back
#define mkp make_pair
#define qxx(i,x) for(int i = head[x]; ~i; i = node[i].nex)
#define F first
#define S second
#define lowbit(x) ((-(x))&(x))
#define RE register
#define getchar() getchar_unlocked()
#ifdef DEBUG
void err(istream_iterator<string>){}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << ' ';
err(++it, args...);
}
#define debug(args...) {string _s=#args;replace(seg(_s),',',' ');\
cerr<<"DEBUG:";istringstream it(_s);\
err(istream_iterator<string>(it), args);cerr<<endl;}
#else
#define debug(...)
#endif
template<typename T> inline bool cmax(T& a,const T& b) {return a<b?a=b,1:0;}
template<typename T> inline bool cmin(T& a,const T& b) {return a>b?a=b,1:0;}
#ifdef GOODOJ
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
typedef __gnu_pbds::priority_queue<int> pq;
#endif
typedef std::string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pa;
const double P = acos(-1.0), eps = 1e-9;
struct point { db x ,y;};
inline int sign(db a) {return a < -eps ? -1 : a > eps;}
#define dot(p1,p2,p3) ((p2.x-p1.x)*(p3.x-p1.x)+(p2.y-p1.y)*(p3.y-p1.y))
#define cross(p1,p2,p3) ((p2.x-p1.x)*(p3.y-p1.y)-(p3.x-p1.x)*(p2.y-p1.y))
#define crossOp(p1,p2,p3) sign(cross(p1,p2,p3))
constexpr int Ma = 1e6, inf = 0x3f3f3f3f, mod = 1e9 + 7;
signed main() {
#if SYNC==0
ios::sync_with_stdio(false);
cin.tie(0);
#endif
ll k; cin >> k;
ll cnt = 0;
fep (i, 1, k + 1) {
for (int j = 1; j <= k / i; j++) {
cnt += k / i / j;
}
}
cout << cnt << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin()
#define UB(a,x) ub(all(a),x)-a.begin()
#define mod 1000000007
//#define mod 998244353
#define FS fixed<<setprecision(15)
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
template<class T> using V=vector<T>;
using P=pair<ll,ll>;
typedef unsigned long long ull;
typedef long double ldouble;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline void out(T a){ cout << a << '\n'; }
void YN(bool ok){if(ok) cout << "Yes" << endl; else cout << "No" << endl;}
//void YN(bool ok){if(ok) cout << "YES" << endl; else cout << "NO" << endl;}
const ll INF=1e18;
const int mx=200005;
//arc110
ll mod_pow(ll x,ll n,ll m){
if(n==0) return 1;
ll res=mod_pow(x*x%m,n/2,m);
if(n&1) res=res*x%m;
return res;
}
ll modinv(ll n){
return mod_pow(n,mod-2,mod);
}
int main(){
//オーバーフローは大丈夫ですか？？
cin.tie(0);ios::sync_with_stdio(false);
ll n,m;
cin>>n>>m;
V<ll> a(n);
ll sum=0;
bool is0=0;
rep(i,n){
cin>>a[i];
sum+=a[i];
}
ll ans=1;
if(sum+n>n+m) ans=0;
else{
for(ll i=1;i<=sum+n;i++){
ans=ans*(m+n-i+1)%mod;
ans=ans*modinv(i)%mod;
}
}
out(ans);
}
//ペナルティ出しても焦らない ACできると信じろ！！！
//どうしてもわからないときはサンプルで実験 何か見えてくるかも
//頭で考えてダメなら紙におこせ！！
/*
V,P(大文字)使用不可
乗算などの際にオーバーフローに注意せよ！
(適切にmodをとれ にぶたんで途中で切り上げろ)
制約をよく読め！
{
・全探索できるなら全探索しろ
・異常な制約ならそこに注目
}
stringの計算量(扱い)注意
コーナー注意！(特に数値が小さいものについては要検証)
N行出力のときは'¥n'
グリッド上では行先が範囲内におさまるかif文で確認(RE注意)
if文ではちゃんと比較演算子==を使え('='でもエラー出ない)
配列(vector)の大きさが0か1以上かで場合分けせよ(RE注意)
(vector<int> a(m)でm==0というものはできない)
modはなるべく最後に取れ！
doubleを扱うときには(abs)ではなく'fabs'!!!
dpするときは「配る」、「もらう」の両方を考えて最適な方を選べ
Segtreeで区間最大(max)を使うとき,単位元の設定をしっかり
(デフォルトは-INF,0の方が都合の良い場合は変更)
*/ | #include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <climits>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <functional>
#include <cfloat>
#include <numeric>
#include <random>
#include <sstream>
#include <bitset>
#include <complex>
#include <chrono>
#include <cassert>
#include <chrono>
constexpr int MOD = 1000000007;
long long int power(long long int base, int exp) {
long long int result{ 1 };
while (exp > 0) {
if (exp & 1) {
result = (result * base) % MOD;
}
exp >>= 1;
base = (base * base) % MOD;
}
return result;
}
long long int combination(const int n, const int r) {
long long int result{ 1 };
for (auto i = 0; i < r; ++i) {
result = (result * (n - i)) % MOD;
}
std::vector<long long int> div(r + 1, 1);
for (auto i = 2; i <= r; ++i) {
div[i] = (MOD - MOD / i) * div[MOD % i] % MOD;
result = result * div[i] % MOD;
}
return result;
}
int main() {
int n, m; std::cin >> n >> m;
std::vector<int> series(n);
for (auto& a : series) std::cin >> a;
const auto sum = std::accumulate(series.begin(), series.end(), 0);
if (sum > m) {
std::cout << "0\n";
return 0;
}
std::cout << combination(n + m, sum + n) << '\n';
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using P = pair<int,int>;
#define INF 1001001001
#define LINF (1LL<<60)
#define F first
#define S second
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; }
struct UnionFind {
vector<int> p;
vector<int> sizes;
UnionFind(int n) : p(n), sizes(n, 1) {
rep(i,n) p[i] = i;
}
int find(int x) {
if (x == p[x]) return x;
return p[x] = find(p[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (sizes[x] < sizes[y]) swap(x, y);
p[y] = x;
sizes[x] += sizes[y];
}
bool isSame(int x, int y) {
return find(x) == find(y);
}
int size(int x) {
return sizes[find(x)];
}
};
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
if (n == 1) {
cout << 0 << endl;
return 0;
}
int M = 200010;
UnionFind uf(M);
int ans = 0;
rep(i, n) uf.unite(a[i], a[n-1-i]);
rep(i, M) {
if (i != uf.find(i)) continue;
ans += uf.size(i)-1;
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
struct UF {
int n;
vector<int> par;
vector<int> rank;
UF(int n) : n(n) {
for (int i = 0; i < n; ++i) {
par.resize(n);
rank.resize(n);
par.at(i) = i;
rank.at(i) = 0;
}
}
int find(int x) {
if (par.at(x) == x) {
return x;
} else {
return par.at(x) = find(par.at(x));
}
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
if (rank.at(x) < rank.at(y)) {
par.at(x) = y;
} else {
par.at(y) = x;
if (rank.at(x) == rank.at(y)) rank.at(x)++;
}
}
bool same(int x, int y) {
return find(x) == find(y);
}
int solve() {
unordered_map<int, int> m;
for (int i = 0; i < n; ++i) {
m[find(i)]++;
}
int ans = 0;
for (auto p : m) {
ans += p.second - 1;
}
return ans;
}
};
int main() {
int n;
cin >> n;
int key = 0;
vector<int> a(n);
unordered_map<int, int> m;
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
if (m.find(a.at(i)) == m.end()) {
m[a.at(i)] = key;
key++;
}
}
UF uf(key);
for (int i = 0; i < (n+1) / 2; ++i) {
int x = m.at(a.at(i));
int y = m.at(a.at(n-i-1));
if (x != y) {
uf.unite(x, y);
}
}
cout << uf.solve() << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define FOR(i,n) for(int i=0;i<n;i++)
typedef long long ll;
const int MAXN = 2e5;
int x[MAXN], y[MAXN];
int main() {
// freopen("in", "r", stdin);
// freopen("out", "w", stdout);
int n, ans=0;
scanf("%d", &n);
FOR(i,n)
scanf("%d%d", &x[i], &y[i]);
rep(i,0,n) rep(j,i+1,n)
if(abs(y[j]-y[i])<=abs(x[j]-x[i])) ans++;
printf("%d", ans);
return 0;
}
| #include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
//const int mod = 1e9+7;
const int MAXN = 110;
double d[MAXN], h[MAXN];
int N;
double D, H;
inline void quickread() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
double solve(int idx) {
if(d[idx] == D) {
return H;
}
return ((H + h[idx])*(D-d[idx]) + h[idx]*d[idx] - H*D)/(D - d[idx]);
}
int main() {
quickread();
cin >> N >> D >> H;
for (int i = 0; i < N; i++) {
cin >> d[i] >> h[i];
}
double res = 0;
for (int i = 0; i < N; i++) {
res = max(solve(i), res);
}
cout << fixed << setprecision(6) << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef vector<ll> vec;
#define MAX 1000000007
int main() {
ll a,b,c,d;
cin>>a>>b>>c>>d;
if(a==b+c+d || b==c+d+a || c==b+a+d || d==b+c+a || a+b==c+d || a+c==b+d || a+d==b+c ){
cout<<"Yes"<<"\n";
}
else{
cout<<"No"<<"\n";
}
}
| #include<cstdio>
#define max(a,b) (((a)>(b))?(a):(b))
using namespace std;
int a,b,c;
int main() {
scanf("%d%d%d",&a,&b,&c);
printf("%d",max(c+max(a,b),a+b));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int tt=1;
//cin>>tt;
while(tt--)
{
int r,c,count=0;
cin>>r>>c;
char a[r][c];
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
cin>>a[i][j];
}
}
for(int i=0;i<r-1;i++)
{
for(int j=0;j<c;j++)
{
if(j==c-1)
{
if(a[i][j]=='.' and a[i+1][j]=='.')
count++;
}
else
{
if((a[i][j]=='.' and a[i+1][j]=='.'))
count++;
if((a[i][j]=='.' and a[i][j+1]=='.'))
count++;
}
}
}
for(int i=0;i<c-1;i++)
{
if(a[r-1][i]=='.' and a[r-1][i+1]=='.')
count++;
}
cout<<count;
cout<<"\n";
}
return 0;
} | #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
#include<deque>
using namespace std;
//#define MODE 1
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define DEB2(X) cout<<X<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define DEB2(X) {}
#define END {}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
//typedef std::pair<int,int> P;
struct edge{int to,cost;};
const int INF=100000000000000000;
const int INF2=9223372036854775807;
const int MOD=1000000007;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define min(X,Y) (((int)(X)<(int)(Y))?(X):(Y))
#define max(X,Y) (((int)(X)>(int)(Y))?(X):(Y))
#define NP(X,Y) next_permutation(X,Y)
#define setdouble(X,Y) cout<<fixed<<setprecision(X)<<Y
int ceil2(int a,int b){if(a%b==0){return a/b;}else{return a/b+1;}}
int pow2(int a,int b){int r=1;for(int i=1;i<=b;i++){r*=a;}return r;}
int Log2(int a){int t=0;while(1){if(a==0||a==1){break;}a/=2;t++;}return t;}
int N,M;
char S[110][110];
signed main(){
cin>>N>>M;
REP(i,N){
cin>>S[i];
}
int ans=0;
REP(i,N){
REP(j,M-1){
if(S[i][j]=='.'&&S[i][j+1]=='.'){
ans++;
}
}
}
REP(i,M){
REP(j,N-1){
if(S[j][i]=='.'&&S[j+1][i]=='.'){
ans++;
}
}
}
cout<<ans<<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__) << "] "
int main() {
int a, b;
cin >> a >> b;
int total = 2 * a + 100;
cout << total - b << "\n";
}
| /*Arnab's Code
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define vll vector<ll>
#define vii vector<int>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define take(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define takes(a,n,st) for(ll i=st;i<n+st;i++)cin>>a[i]
ll sum(ll a[],ll n,ll s){ for(ll i=0;i<n;i++)s+=a[i]; return s;}
#define mod 1000000009
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void solve(){
ll a,b,c;
cin>>a>>b;
c=(2*a)+100;
cout<<abs(c-b);
return;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ll t,T;
// cin>>T;
T=1;
for(t=1;t<=T;t++){
// cout<<"Case #"<<t<<": ";
solve();
}
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 998244353;
typedef long long LL;
typedef pair<int, int> P;
template<typename T>
istream& operator >> (istream& is, vector<T>& vs){
for(T& v: vs) is >> v;
return is;
}
int main() {
int H, W; cin >> H >> W;
vector<string> S(H); cin >> S;
vector<vector<int>> C(H, vector<int>(W, 0));
for (int c = 1; c < W; ++c) {
C[0][c] = C[0][c-1] + 1;
}
for (int r = 1; r < H; ++r) {
for (int c = 0; c < W; ++c) {
C[r][c] = C[r-1][c] + 1;
}
}
map<int, char> m;
for (int r = 0; r < H; ++r) {
for (int c = 0; c < W; ++c) {
int x = C[r][c];
char y = S[r][c];
if (m.count(x)) {
if (m[x] != y && y != '.') {
if (m[x] == '.') {
m[x] = y;
} else {
cout << 0 << endl;
return 0;
}
}
} else {
m[x] = S[r][c];
}
}
}
LL ans = 1;
for (const auto& [i, c] : m) {
if (c == '.') {
ans = ans * 2LL;
ans %= kMod;
}
}
cout << ans << endl;
}
| #include<set>
#include<queue>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define MAXN 505
#define ENDL putchar('\n')
#define LL long long
#define DB double
#define lowbit(x) ((-x) & (x))
LL read() {
LL f = 1,x = 0;char s = getchar();
while(s < '0' || s > '9') {if(s=='-')f = -f;s = getchar();}
while(s >= '0' && s <= '9') {x=x*10+(s-'0');s = getchar();}
return f * x;
}
const int MOD = 998244353;
int n,m,i,j,s,o,k;
char ss[MAXN][MAXN];
int tg[MAXN<<1];
int main() {
n = read(); m = read();
for(int i = 1;i <= n;i ++) {
scanf("%s",ss[i] + 1);
for(int j = 1;j <= m;j ++) {
if(ss[i][j] == 'B') {
if(tg[i+j] > 0) {printf("0\n");return 0;}
tg[i+j] = -1;
}
else if(ss[i][j] == 'R') {
if(tg[i+j] < 0) {printf("0\n");return 0;}
tg[i+j] = 1;
}
}
}
int ans = 1;
for(int i = 2;i <= n+m;i ++) {
if(tg[i] == 0) (ans += ans) %= MOD;
}
printf("%d\n",ans);
return 0;
} |
/*
Problem Name:
algorithm tag:
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-4;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
//#define x first
//#define y second
#define iosf ios::sync_with_stdio(false), cin.tie(0), cout << fixed
const int N = 2e5 + 5;
int n, m, Q;
int a[N], b[N];
map<int, int> mp;
map<int, int> mp1;
int idx;
struct Node
{
int l, r;
ll sum;
int num;
} tr1[N * 4], tr2[N * 4];
// a b
void pushup(int u, Node tr[])
{
tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
tr[u].num = tr[u << 1].num + tr[u << 1 | 1].num;
}
void build(int u, int l, int r, Node tr[])
{
tr[u] = {l, r};
if (l == r)
return;
int mid = l + r >> 1;
build(u << 1, l, mid, tr), build(u << 1 | 1, mid + 1, r, tr);
pushup(u, tr);
}
void modify(int u, int x, int v, Node tr[])
{
if (tr[u].l == x && tr[u].r == x) {
tr[u].num += v;
tr[u].sum = (ll)tr[u].num * mp1[x];
} else {
int mid = tr[u].l + tr[u].r >> 1;
if (x <= mid)
modify(u << 1, x, v, tr);
else
modify(u << 1 | 1, x, v, tr);
pushup(u, tr);
}
}
pli query(int u, int l, int r, Node tr[])
{
if (tr[u].l >= l && tr[u].r <= r)
return {tr[u].sum, tr[u].num};
int mid = tr[u].l + tr[u].r >> 1;
pli res = {0, 0};
if (l <= mid)
res = query(u << 1, l, r, tr);
if (r > mid) {
auto temp = query(u << 1 | 1, l, r, tr);
res.first += temp.first;
res.second += temp.second;
}
return res;
}
struct quest
{
int t, x, y;
} seg[N];
int main()
{
iosf;
cin >> n >> m >> Q;
ll ans = 0;
build(1, 0, N, tr1);
build(1, 0, N, tr2);
for (int i = 1; i <= n; i++)
modify(1, 0, 1, tr1);
for (int i = 1; i <= m; i++)
modify(1, 0, 1, tr2);
priority_queue<int, vector<int>, greater<int>> heap;
for (int i = 1; i <= Q; i++) {
int t, x, y;
cin >> t >> x >> y;
heap.push(y);
seg[i] = {t, x, y};
}
int ls = -1;
while (heap.size()) {
int t = heap.top();
heap.pop();
if (t != ls) {
mp[t] = ++idx;
mp1[idx] = t;
}
ls = t;
}
for (int i = 1; i <= Q; i++) {
int t = seg[i].t, x = seg[i].x, y = seg[i].y;
if (t == 1) {
int last = a[x];
a[x] = y;
int pnum = query(1, 0, mp[last], tr2).second;
ll psum = query(1, mp[last] + 1, N, tr2).first;
modify(1, mp[last], -1, tr1);
modify(1, mp[y], 1, tr1);
int snum = query(1, 0, mp[y], tr2).second;
ll ssum = query(1, mp[y] + 1, N, tr2).first;
ans += (ll)snum * y + ssum - (ll)pnum * last - psum;
} else {
int last = b[x];
b[x] = y;
int pnum = query(1, 0, mp[last], tr1).second;
ll psum = query(1, mp[last] + 1, N, tr1).first;
modify(1, mp[last], -1, tr2);
modify(1, mp[y], 1, tr2);
int snum = query(1, 0, mp[y], tr1).second;
ll ssum = query(1, mp[y] + 1, N, tr1).first;
ans += (ll)snum * y + ssum - (ll)pnum * last - psum;
}
cout << ans << endl;
}
} | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int main(){
int N;
ll W;
cin >> N >> W;
vector<ll> vec(2*100000+2,0);
for(int i=0; i<N; i++){
int S,T;
ll P;
cin >> S >> T >> P;
vec[S]+=P;
vec[T]-=P;
}
for(int i=0; i<(int)vec.size()-1; i++){
vec[i+1]+=vec[i];
if(vec[i]>W){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
int n, m;
vector<int> adj[MAX_N];
long long int a[MAX_N], b[MAX_N];
bool vis[MAX_N];
long long dfs(int u) {
long long ans = a[u] - b[u];
vis[u] = true;
for (int v : adj[u]) {
if (vis[v])
continue;
ans += dfs(v);
}
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
cin >> b[i];
vis[i] = false;
}
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
for (int i = 0; i < n; i++) {
if (vis[i])
continue;
if (dfs(i) != 0) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
}
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
int N, M, A[500], B[500];
vector<int> Adj[25];
int used[25];
int loop;
int cnt;
long long int num;
int color[25];
vector<int> child[25];
vector<int> V;
void visit(int k) {
used[k] = 1; V.push_back(k);
cnt++;
for (auto y : Adj[k]) {
if (used[y] == 0) { child[k].push_back(y); visit(y); }
}
}
int po;
void dfs(int k) {
for (int j = 0; j <= 2; j++) {
int possible = 1;
for (auto y : Adj[k]) {
if (color[y] == j) { possible = -1; break; }
}
if (possible==1) {
color[k] = j; po++; if (po == cnt) {
//for (int i = 1; i <= N; i++) { cout << "color[" << i << "]= " << color[i] << endl; }
num++;
}
else {
for (auto z : child[k]) {
dfs(z);
}
}
color[k] = -1; po--;
}
}
}
void CALC(int k) {
int M = V.size();
if (k == M) { num++; return; }
for (int j = 0; j <= 2; j++) {
int possible = 1;
for (auto y : Adj[V[k]]) {
if (color[y] == j) { possible = -1; break; }
}
if (possible == 1) {
color[V[k]] = j;
CALC(k + 1);
color[V[k]] = -1;
}
}
}
int main(void) {
cin >> N >> M;
for (int i = 1; i <= M; i++) {
cin >> A[i] >> B[i];
Adj[A[i]].push_back(B[i]);
Adj[B[i]].push_back(A[i]);
}
long long int ans = 1;
for (int i = 1; i <= N; i++) {
if (used[i] == 0) {
V.clear();
cnt = 0;
visit(i);
//cout << "cnt= " << cnt << endl;
for (int i = 1; i <= N; i++) { color[i] = -1; }
num = 0; po = 0;
CALC(0);
ans *= num;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
// a^n (mod.MOD)を求める。計算量はO(logn)
ll modpow(ll a, ll n, ll MOD = mod) {
if(n == 0) {
return 1;
}
if(n%2 == 1) {
return (a * modpow(a, n-1, MOD))%MOD;
}
return (modpow(a, n/2, MOD) * modpow(a, n/2, MOD))%MOD;
}
int main() {
ll n;
cin >> n;
char cAA, cAB, cBA, cBB;
cin >> cAA >> cAB >> cBA >> cBB;
if(n == 2) {
out(1);
re0;
}
if( (cAA == 'A' && cAB == 'B' && cBA == 'A' && cBB == 'A') ||
(cAA == 'B' && cAB == 'A' && cBA == 'B' && cBB == 'A') ||
(cAA == 'B' && cAB == 'A' && cBA == 'B' && cBB == 'B') ||
(cAA == 'B' && cAB == 'B' && cBA == 'A' && cBB == 'A')
) {
out(modpow(2LL, n-3));
}
else if ( (cAA == 'A' && cAB == 'B' && cBA == 'B' && cBB == 'A') ||
(cAA == 'B' && cAB == 'A' && cBA == 'A' && cBB == 'A') ||
(cAA == 'B' && cAB == 'A' && cBA == 'A' && cBB == 'B') ||
(cAA == 'B' && cAB == 'B' && cBA == 'B' && cBB == 'A')
) {
vl f(n); // f[i] : フィボナッチ数列のi項目
f[1] = f[2] = 1;
exrep(i, 3, n-1) {
f[i] = (f[i-1] + f[i-2])%mod;
}
out(f[n-1]);
}
else {
out(1);
}
re0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
long long ksm(long long x,long long y)//快速幂
{
if(x==0) return 0;
long long ret=1;
for(;y;y>>=1)
{
if(y&1) ret=(ret*x);
x=(x*x);
}
return (ret);//最后%一下
}
int main()
{
ll n;
scanf("%lld",&n);
for(int i=1;i<=40;i++)
for(int j=1;j<=27;j++)
{
if(ksm(3,i)+ksm(5,j)==n)
{
printf("%d %d\n",i,j);
return 0;
}
}
printf("-1\n");
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <iomanip>
using namespace std;
#define DEBUG_ //!!$BDs=P;~$K%3%a%s%H%"%&%H(B!!
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a,b) (fabs((a)-(b)) < EPS)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
//#define int long long
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template <typename T>
std::string printVector(const std::vector<T> &data)
{
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T>
void print_array(const T &ary, int size){
REP(i,size){
cout << ary[i] << " ";
}
cout << endl;
}
const int mod = 1e9+7;
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899;
int dx[] = {0,0,-1,1};
int dy[] = {-1,1,0,0};
struct Func{
LL left = -LINF;
LL right = LINF;
LL offset = 0;
void update(int t, LL a){
if(t == 1){
offset += a;
if(left != -LINF) left += a;
if(right != LINF) right += a;
}
if(t == 2){
chmax(left, a);
chmax(right, a);
}
if(t == 3){
chmin(left, a);
chmin(right, a);
}
}
LL get(LL x){
if(left == right){
return left;
}
if(left == -LINF && right == LINF){
return x + offset;
}
if(left == -LINF){
return min(right, x + offset);
}
if(right == LINF){
return max(left, x + offset);
}
LL x1 = left - offset;
LL x2 = right - offset;
if(x < x1) return left;
if(x > x2) return right;
return x + offset;
}
};
signed main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
int N; cin >> N;
Func f;
REP(i,N){
LL a;
int t;
cin >> a >> t;
f.update(t,a);
}
int Q; cin >> Q;
REP(i,Q){
LL x; cin >> x;
cout << f.get(x) << "\n";
}
} | #pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i,a,b) for(int i = a; i < b; i++)
#define all(a) a.begin(),a.end()
//#define endl '\n'
using ll = long long;
//using db = long double;
using ii = pair<int, int>;
const int N = 2e5 + 5, LG = 19, MOD = 998244353;
const int SQ =225;
int fast(int b, int c, int m) {
if(c == 0)
return 1;
if(c & 1)
return b * fast(b,c-1,m) % m;
return fast(b * b % m, c >> 1,m);
}
int32_t main(){
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
string s;
cin >> s;
ll ans = 0;
reverse(s.begin(),s.end());
int cnt[26] = {};
cnt[s[0]-'a'] += 1;
for(int i = 2; i < s.size(); i++) {
if(s[i] == s[i-1]) {
ans += i-1-(cnt[s[i]-'a']);
memset(cnt,0,sizeof cnt);
cnt[s[i]-'a'] = i;
} else {
cnt[s[i-1]-'a'] += 1;
}
}
cout << ans << '\n';
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <cstdlib>
#include <algorithm>
#define MAXA 1000000
#define ll long long
using namespace std;
vector<int> divs[MAXA+2];
int smallest_prime[MAXA+2];
bool isprime[MAXA+2];
int counts[MAXA+2];
int moebius[MAXA+2];
int g(int N,int x) {
int ans2=0;
for(int y : divs[N]) {
ans2 += (x/y)*moebius[y];
}
return -ans2;
}
int main() {
for(int i=2;i<=MAXA;i++) {
for(int j=1;j<=MAXA/i;j++) {
divs[i*j].push_back(i);
}
}
for(int i=1;i<=MAXA;i++) {
smallest_prime[i]=-1;
isprime[i]=true;
counts[i]=0;
}
for(int i=2;i<=MAXA;i++) {
if(smallest_prime[i]==-1) {
for(int j=i;j<=MAXA/i;j++) {
smallest_prime[j*i]=i;
isprime[j*i]=false;
}
smallest_prime[i]=i;
}
}
moebius[1]=1;
for(int i=2;i<=MAXA;i++) {
int x=i;
int p=smallest_prime[i];
while(x%p==0) {
x/=p;
}
if(x*p==i) {
moebius[i]=-moebius[x];
} else {
moebius[i]=0;
}
}
int L,R;
cin>>L>>R;
ll ans = 0;
for(int y=L;y<=R;y++) {
int curr = y-L;
for(int d : divs[y]) {
if (d >= L && d < y) curr--;
}
curr -= y-L-g(y,y-1)+g(y,L-1);
ans += curr;
}
cout << 2*ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
//mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,T y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,T y){if(x>y)x=y;}
inline int read(){
#define nc getchar()
int x=0;char c=nc;bool f=0;
while(c<48)f|=c=='-',c=nc;
while(c>47)x=x*10+(c^48),c=nc;
return f?-x:x;
#undef nc
}
typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;
const int maxn=2e5+10;
int n,k;vi E[maxn];
int mid;
int res,F[maxn],G[maxn];
void dfs(int u,int f){
F[u]=1e9,G[u]=-1;
for(int v:E[u])if(v!=f){
dfs(v,u);
chkmin(F[u],F[v]+1);
}
for(int v:E[u])if(v!=f){
if(G[v]+F[u]>=mid){
chkmax(G[u],G[v]+1);
}
}
if(F[u]>mid)chkmax(G[u],0);
if(G[u]==mid){
res++,F[u]=0,G[u]=-1;
}
}
void solve(){
cin>>n>>k;
rep(i,2,n){
int u=read(),v=read();E[u].push_back(v),E[v].push_back(u);
}
int l=1,r=n;
while(l<r){
mid=(l+r)/2,res=0,dfs(1,0);
if(G[1]!=-1)res++;
res<=k?r=mid:l=mid+1;
}
cout<<l<<endl;
}
signed main(){
// int T=read();
// while(T--)solve();
solve();
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(X) (X).begin(), (X).end()
#define allr(X) (X).rbegin(), (X).rend()
#define sz(X) (int)X.size()
#define setbits(X) __builtin_popcountll(X)
#define fix(X) fixed << setprecision(X)
#define mem0(X) memset((X), 0, sizeof((X)))
#define mem1(X) memset((X), -1, sizeof((X)))
void solve() {
int x, y;
cin >> x >> y;
if (x == y) {
cout << x << endl;
return;
}
if (x > y) {
swap(x, y);
}
if (x + 1 == y) {
int chk = (y + 1) % 3;
cout << (chk == 0 ? 0 : chk) << endl;
return;
} else {
cout << x + 1 << endl;
return;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while (t--) solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll DIM = 200007, maxN = 200000, INF = 10000000000007, mod = 1000000007;
ll t, n, k, a[DIM], b[207];
string s;
vector<ll> simple_numbers;
bool flag;
void solve() {
cin >> n >> k;
for (int i = 1; i <= k; ++i) {
if (n % 200 == 0) n /= 200;
else {
n *= 1000;
n += 200;
}
}
cout << n << '\n';
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
//cin >> t;
t = 1;
while(t--)
solve();
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
const ll MOD=1000000007;
/*----------------FPOW----------------*/
ll fpow(ll b, ll e){
ll res=1;
while(e){
if(e&1)res=res*b%MOD;
b=b*b%MOD,e>>=1;
}
return res;
}
int main(){FIN;
ll n; cin>>n;
vector<ll> a(n);
fore(i,0,n)cin>>a[i];
vector<ll> fib(n+1);
fib[0]=1;
fib[1]=1;
fore(i,2,n+1)fib[i]=(fib[i-1]+fib[i-2])%MOD;
ll res=fib.back()*a[0]%MOD;
if(n>=3){
fore(i,1,n){
ll t=fib.back();
if(i==1||i==n-1)t=(t-2ll*fib[n-2])%MOD;
else t=(t-2ll*fib[i-1]*fib[n-i-1])%MOD;
//cout<<t<<"\n";
if(t<0)t+=MOD;
t=t*a[i]%MOD;
res=(res+t)%MOD;
}
}
cout<<res<<"\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
map<ll, ll> factorize(ll num) {
map<ll, ll> primary_map;
for (ll i = 2; i * i <= num; i++) {
if (num % i != 0) continue;
ll ex = 0;
while (num % i == 0) {
ex++;
num /= i;
}
primary_map[i] += ex;
}
if (num != 1) primary_map[num] += 1;
return primary_map;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
ll cnt = 1;
map<ll, ll> result;
for (ll i = 2; i <= n; i++) {
map<ll, ll> m = factorize(i);
for (ll i = 2; i <= n; i++) {
if (is_prime(i)) result[i] = max(m[i], result[i]);
}
}
auto begin = result.begin(), end = result.end();
for (auto iter = begin; iter != end; iter++) {
for (ll i = 0; i < iter->second; i++) {
cnt *= iter->first;
}
}
cout << cnt + 1 << endl;
} |
Subsets and Splits