code_file1
stringlengths 87
4k
| code_file2
stringlengths 85
4k
|
|---|---|
#include <cstdio>
#include <queue>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> a(n*2);
for(int& i: a)
scanf("%d", &i);
priority_queue<int> q;
long long ans=0;
for(int i = 0;i < n;i ++){
q.push(a[i]);
q.push(a[n*2-1-i]);
ans+=q.top();
q.pop();
}
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int Maxn = 100005;
int n;
int a[Maxn];
int main()
{
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a, a + n + 1);
int res = 1;
for (int i = 1; i <= n; i++)
res = ll(res) * (a[i] - a[i - 1] + 1) % mod;
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define pii pair<ll,ll>
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#define autoit(x,it) for(auto it = x.begin(); it != x.end(); it++)
#define autoitr(x,it) for(auto it = x.rbegin(); it != x.rend(); it++)
#define rep(n) for(ll i = 0; i < n; i++)
#define repi(i,n) for(ll i = 0; i < n; i++)
#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>
using namespace std;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
FAST/**/
ll a,b,c,d;
cin>>a>>b>>c>>d;
cout<<(a*d - b*c);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> A1(2),A2(2);
for(int i =0; i <2; i++)
{
cin >> A1[i];
}
for(int i =0; i <2; i++)
{
cin >> A2[i];
}
int ans = A1[0]*A2[1]-A1[1]*A2[0];
cout << ans << endl;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=205;
const int DS=900;
int n,tot,ran[10];
int x[N],y[N],r[N],a[N],b[N],c[N],d[N],s[N],que[N];
unsigned int Se;
set<pair<int,int> > S;
set<pair<int,int> > :: iterator it;
pair<int,int> aa[N];
bool U(int i){
a[i]--; bool flag=0;
for (int j=1; j<=n; j++){
if (i==j) continue;
if (max(a[i],a[j])<min(c[i],c[j]) && max(b[i],b[j])<min(d[i],d[j])){ flag=1; break; }
}
if (!flag){
S.erase(make_pair(r[i]-s[i],i));
s[i]+=d[i]-b[i];
if (s[i]>=r[i]+DS) que[i]=-1,tot--;
else S.insert(make_pair(r[i]-s[i],i));
return 1;
}
a[i]++;
return 0;
}
bool D(int i){
c[i]++; bool flag=0;
for (int j=1; j<=n; j++){
if (i==j) continue;
if (max(a[i],a[j])<min(c[i],c[j]) && max(b[i],b[j])<min(d[i],d[j])){ flag=1; break; }
}
if (!flag){
S.erase(make_pair(r[i]-s[i],i));
s[i]+=d[i]-b[i];
if (s[i]>=r[i]+DS) que[i]=-1,tot--;
else S.insert(make_pair(r[i]-s[i],i));
return 1;
}
c[i]--;
return 0;
}
bool L(int i){
b[i]--; bool flag=0;
for (int j=1; j<=n; j++){
if (i==j) continue;
if (max(a[i],a[j])<min(c[i],c[j]) && max(b[i],b[j])<min(d[i],d[j])){ flag=1; break; }
}
if (!flag){
S.erase(make_pair(r[i]-s[i],i));
s[i]+=c[i]-a[i];
if (s[i]>=r[i]+DS) que[i]=-1,tot--;
else S.insert(make_pair(r[i]-s[i],i));
return 1;
}
b[i]++;
return 0;
}
bool R(int i){
d[i]++; bool flag=0;
for (int j=1; j<=n; j++){
if (i==j) continue;
if (max(a[i],a[j])<min(c[i],c[j]) && max(b[i],b[j])<min(d[i],d[j])){ flag=1; break; }
}
if (!flag){
S.erase(make_pair(r[i]-s[i],i));
s[i]+=c[i]-a[i];
if (s[i]>=r[i]+DS) que[i]=-1,tot--;
else S.insert(make_pair(r[i]-s[i],i));
return 1;
}
d[i]--;
return 0;
}
int main(){
// freopen("a.out","w",stdout);
scanf("%d",&n); tot=n;
srand(303837088);
for (int i=1; i<=n; i++){
scanf("%d%d%d",&x[i],&y[i],&r[i]);
a[i]=x[i],b[i]=y[i],c[i]=x[i]+1,d[i]=y[i]+1; s[i]=1;
S.insert(make_pair(r[i]-s[i],i));
aa[i]=make_pair(r[i]-s[i],i);
}
sort(aa+1,aa+1+n);
ran[1]=1,ran[2]=2,ran[3]=3,ran[4]=4;
for (int i=1; i<=50; i++)
for (int J=n; J<=n-20; J++){
int x=aa[J].second;
if (que[x]==-1) continue;
random_shuffle(ran+1,ran+5);
for (int j=1; j<=4; j++){
if (ran[j]==1 && a[x]>0 && U(x)) break;
if (ran[j]==2 && c[x]<10000 && D(x)) break;
if (ran[j]==3 && b[x]>0 && L(x)) break;
if (ran[j]==4 && d[x]<10000 && R(x)) break;
}
}
for (int i=1; i<=300000; i++){
if (!tot) break; int x;
if (rand()%4==1 && !S.empty()){
it=S.end(); it--;
x=(*it).second;
} else {
x=rand()%n+1;
while (que[x]==-1) x=rand()%n+1;
}
random_shuffle(ran+1,ran+5);
for (int j=1; j<=4; j++){
if (ran[j]==1 && a[x]>0 && U(x)) break;
if (ran[j]==2 && c[x]<10000 && D(x)) break;
if (ran[j]==3 && b[x]>0 && L(x)) break;
if (ran[j]==4 && d[x]<10000 && R(x)) break;
}
}
for (int i=1; i<=n; i++) printf("%d %d %d %d\n",a[i],b[i],c[i],d[i]);
return 0;
} | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
const int INF=1<<30;
template<typename T> inline bool chkmax(T &aa, T bb) { return aa < bb ? aa = bb, true : false; }
template<typename T> inline bool chkmin(T &aa, T bb) { return aa > bb ? aa = bb, true : false; }
typedef pair<ll,ll> pll;typedef vector<ll> vll;typedef pair<int,int> pii;typedef vector<int> vi;typedef vector<vi> vvi;typedef vector<pii> vpii;typedef vector<pll> vpll;
template<typename T> void makeunique(vector<T> &vx) {sort(vx.begin(),vx.end());auto it=unique(vx.begin(),vx.end());vx.resize(std::distance(vx.begin(),it));}
void solve(long long n, std::vector<long long> A, std::vector<long long> B){
ll sumA=0;
for (auto &w:A) sumA+=w;
vll C[2];
for (int i=0;i<n;i++) {
C[i%2].PB(B[i]-A[i]);
}
for (int k=0;k<2;k++) sort(C[k].begin(),C[k].end(),greater<ll>());
ll ans=0;
for (int i=0;i<C[0].size();i++) {
ll now=C[0][i]+C[1][i];
if (now>0) ans+=now;
}
ll final=ans+sumA;
printf("%lld\n",final);
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
int main(){
long long N;
scanf("%lld",&N);
std::vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
std::vector<long long> B(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&B[i]);
}
solve(N, std::move(A), std::move(B));
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define ALL(a) (a).begin(), (a).end()
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
string func(string n) {
int length = n.length();
bool flag = (3 <= length) ? true : false;
if (flag) {
string t = n.substr(length - 3, 3);
int a = stoi("1" + t);
flag = (a % 200 == 0) ? true : false;
}
string ans = "";
if (flag) {
int plus = 0;
rep(i, 0, length - 2) {
int tmp = n[i] - '0';
int pre = (plus + tmp) / 2;
plus = (tmp % 2 == 0) ? 0 : 10;
if (i == 0 && pre == 0) {
continue;
}
ans += to_string(pre);
}
return ans;
} else {
ans = n + "200";
return ans;
}
}
int main(void) {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
string n;
ll k;
cin >> n >> k;
rep(i, 0, k) { n = func(n); }
cout << n << endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
using namespace std;
ll i,t, n,j, a[200600], ans;
double temp;
bool cond;
char c;
string s;
int main()
{
//I am Monim, a tiny creature of Allah
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
ans = 0;
for(i=0;i<n;i++)
ans+= abs(a[i]);
cout << ans << endl;
ans = 0;
for(i=0;i<n;i++)
ans+= abs(a[i]*a[i]);
temp = (double)sqrt(ans);
cout <<fixed<<setprecision(12)<< temp << endl;
ans = -10000000000;
for(i=0;i<n;i++)
ans = max(ans,abs(a[i]));
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
template <class T> void chkmax(T& x, T y) { x = (x > y ? x : y); }
template <class T> void chkmin(T& x, T y) { x = (x < y ? x : y); }
typedef long long LL;
typedef pair <int, int> pii;
typedef vector <int> vi;
const int N = 2e5 + 5;
int n, m, K;
int a[N], last[N];
vi e[N];
struct fenwick {
int d[N];
void init(int sz){
memset(d, 0, sizeof(d));
rep1(i, sz + 1){
a[i] = 1;
modify(i, 1);
}
}
void modify(int x, int val){
while (x <= m){
d[x] += val;
x += (x & -x);
}
}
int query(int x){
int ret = 0;
while (x){
ret += d[x];
x -= (x & -x);
}
return ret;
}
} fenwick;
int main(){
scanf("%d%d%d", &n, &m, &K);
rep1(i, n + 1) last[i] = m;
fenwick.init(m);
rep(i, K){
int x, y; scanf("%d%d", &x, &y);
e[x].PB(y);
chkmin(last[x], y - 1);
}
LL ret = 0;
rep1(i, n + 1){
for (auto j : e[i]) if (a[j]){
a[j] = 0;
fenwick.modify(j, -1);
}
if (a[1]){
ret += last[i];
ret += max(0, fenwick.query(last[1]) - fenwick.query(last[i]));
} else {
ret += fenwick.query(last[1]);
}
}
printf("%lld\n", ret);
return 0;
} | #include<bits/stdc++.h>
#define fi first
#define se second
#define pb(i) push_back(i)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=b;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define VI vector<int>
#define VLL vector<ll>
#define MPII map<pair<int,int>,int>
#define mp make_pair
#define PQI priority_queue<int>
#define lowbit(x) x&-x
#define debug(a) cout<<#a<<'='<<a<<'\n'
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int N = 1e6+10;
const int INF = 0x3f3f3f3f;
const int inf = - INF;
const int mod = 1e9+7;
const double pi = acos(-1.0);
const double eps=1e-5;
const int M = 2e5 + 10;
struct point{
int x,y;
bool operator < (point p) const{
return x == p.x ? y < p.y : x < p.x;
}
}p[N];
int vis[M],c[M];
int getsum(int x){
int res = 0;
while (x){
res += c[x];
x -= lowbit(x);
}
return res;
}
void update(int x, int y, int n){
while (x <= n){
c[x] += y;
x += lowbit(x);
}
}
int main()
{
int h, w, m;
scanf("%d%d%d",&h, &w, &m);
int mx = INF, my = INF;
for (int x, y, i = 1; i<= m; i++){
scanf("%d%d", &x, &y);
p[i] = (point){x,y};
if (y == 1)
mx = min (mx ,x);
if (x == 1)
my = min (my ,y);
}
for (int i = mx + 1; i <= h; i++){
p[++m].x = i;
p[m].y = 1;
}
for (int i = my + 1; i <= w; i++){
p[++m].x = 1;
p[m].y = i;
}
sort(p + 1, p + 1 + m);
ll cnt = 0, pos = 1;
for (int i = 1; i <= m; i++){
if (!vis[p[i].y]){
vis[p[i].y] = 1;
update(p[i].y, 1, w);
}
if (i == m || p[i].x != p[i + 1].x){
cnt += getsum(w) - getsum(p[pos].y - 1);
pos = i + 1;
}
}
printf("%lld\n", 1ll * h * w - cnt);
return 0;
} |
//μ's forever
#include <bits/stdc++.h>
#define mod 998244353
#define getchar nc
using namespace std;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
register int x=0,f=1;register char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return x*f;
}
inline void write(register int x)
{
if(!x)putchar('0');if(x<0)x=-x,putchar('-');
static int sta[20];register int tot=0;
while(x)sta[tot++]=x%10,x/=10;
while(tot)putchar(sta[--tot]+48);
}
int n,k,f[3005][3005];
int main()
{
n=read(),k=read();
for(register int i=0;i<=k;++i)
f[n-k][i]=1;
for(register int i=n-k-1;i>=0;--i)
for(register int j=n;j>=0;--j){
// cerr<<i<<" "<<j<<endl;
if(j%2==0&&i+(j>>1)<=n)
f[i][j]=f[i+(j>>1)][j>>1];
// cerr<<i<<" "<<j<<endl;
f[i][j]=(0ll+f[i][j]+f[i][j+1])%mod;
}
write(f[0][0]);
return 0;
}
| #include<bits/stdc++.h>
#define ll long long
#define mod 998244353
#define N 55
using namespace std;
int n,a[N][N],lim,f[2][N],sze[N],sm[N];
inline int find(int x,int way)
{
return f[way][x]==x?x:f[way][x]=find(f[way][x],way);
}
int main()
{
#ifdef lovelyG
Sfile(1);
#endif
scanf("%d%d",&n,&lim);
for(int i=1;i<=n;++i)f[0][i]=f[1][i]=i;//0 r 1 c
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
{
scanf("%d",&a[i][j]);
}
}
for(int i=1;i<=n;++i)
{
for(int j=i+1;j<=n;++j)
{
bool pt=1;
for(int k=1;k<=n;++k)
{
if(a[i][k]+a[j][k]>lim)
{
pt=0;
break;
}
}
if(pt)
{
f[0][find(i,0)]=f[0][find(j,0)];
}
}
}
for(int i=1;i<=n;++i)
{
for(int j=i+1;j<=n;++j)
{
bool pt=1;
for(int k=1;k<=n;++k)
{
if(a[k][i]+a[k][j]>lim)
{
pt=0;
break;
}
}
if(pt)
{
f[1][find(i,1)]=f[1][find(j,1)];
}
}
}
int ans=1;sm[0]=1;
for(int i=1;i<=n;++i)
sm[i]=1ll*sm[i-1]*i%mod;
for(int ii=0;ii<=1;++ii)
{
memset(sze,0,sizeof sze);
for(int i=1;i<=n;++i)
{
++sze[find(i,ii)];
}
for(int i=1;i<=n;++i)
ans=1ll*ans*sm[sze[i]]%mod;
}
printf("%d",ans);
return 0;
} |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
V<ll> p={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
int main(){
ll a,b;
cin>>a>>b;
V<ll> dp((1<<20),0);
dp[0]=1;
V<ll> tmp={};
for(ll i=a;i<=b;i++){
ll v=0;
for(int j=0;j<20;j++){
if(i%p[j]==0)v+=(1ll<<j);
}
tmp.emplace_back(v);
}
int m=tmp.size();
for(int i=0;i<m;i++){
for(ll j=0;j<(1<<20);j++){
if((j&tmp[i])>0)continue;
dp[j|tmp[i]]+=dp[j];
}
}
ll ans=0;
for(int i=0;i<(1<<20);i++)ans+=dp[i];
cout<<ans<<"\n";
} | #include<bits/stdc++.h>
#define f(i,n) for(long long int i = 0 ; i < n; i++)
#define F first
#define S second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define all(s) s.begin(), s.end()
#define u_s unordered_set
#define u_m unordered_map
#define ll long long int
#define pb push_back
#define pll pair<ll,ll>
#define parr(arr) for(auto x: arr)cout<<x<<" ";cout<<endl
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define testcase ll tt; cin>>tt; while(tt--)
using namespace std;
ll solve(){
ll n; cin>>n;
vector<array<ll,3>> v;
f(i,n){
ll op; cin>>op;
ll l, r; cin>>l>>r;
v.pb({op, l, r});
}
ll ans = 0;
map<int,string> m;
m[1] = "[]";
m[2] = "[)";
m[3] = "(]";
m[4] = "()";
f(i,n){
ll opi = v[i][0];
string opis = m[opi];
ll si = v[i][1];
ll ei = v[i][2];
for(ll j = i+1; j < n; j++){
ll opj = v[j][0];
string opjs = m[opj];
ll sj = v[j][1];
ll ej = v[j][2];
bool flag1, flag2;
if(opjs[0] == '(' || opis[1] == ')'){
flag1 = (sj >= ei);
}else{
flag1 = (sj > ei);
}
if(opjs[1] == ')' || opis[0] == '('){
flag2 = (ej <= si);
}else{
flag2 = (ej < si);
}
if(!(flag1 || flag2)) ans++;
}
}
return ans;
}
int main() {
fast;
cout<<solve();
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=101;
int n,g[N][N],C[N][N],vis[N],to[N];
char s[N][N];
void dfs(int x)
{
if(vis[x])
return;
vis[x]=1;
for(int i=1;i<=n;i++)
if(g[x][i])
dfs(i);
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%s",s[i]+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
g[i][j]=s[i][j]-'0';
for(int i=1;i<=n;i++)
{
fill(vis+1,vis+n+1,0);
dfs(i);
for(int j=1;j<=n;j++)
to[j]+=vis[j];
}
double ans=0;
for(int i=1;i<=n;i++)
ans+=1.0/to[i];
printf("%.10lf\n",ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int MAX = 2e5+10;
int a[MAX];
int b[MAX];
int c[MAX];
vi e[MAX];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i=0;i<n;i++){
cin >> a[i];
b[a[i]] = 1;
}
for(int i=0;i<n/2;i++){
if( a[i] != a[n-i-1] ){
e[a[i]].push_back(a[n-i-1]);
e[a[n-i-1]].push_back(a[i]);
}
}
int cnt = 0;
int v = 0;
for(int i=1;i<MAX;i++){
if( b[i] == 0 ) continue;
v++;
if( c[i] ) continue;
cnt ++;
c[i] = cnt;
deque <int> D;
D.push_back(i);
c[i] = cnt;
while( !D.empty() ){
int x = D.front();
D.pop_front();
for(int y: e[x]){
if( c[y] ) continue;
D.push_back(y);
c[y] = c[x];
}
}
}
cout << v - cnt << endl;
}
|
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <bits/stdc++.h>
#include<queue>
#include <numeric>
#include<stdio.h>
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define fore(i,a) for(auto &i:a)
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
//debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
LL gcd(LL a, LL b){
if(b == 0) return a;
return gcd(b,a%b);
}
LL lcm(LL a, LL b){
LL g = gcd(a,b);
return a/g *b;
}
int ri(){
int n;
scanf("%d",&n);
return n;
}
int main(){
int N;
cin >> N;
map<string, int> mp;
string S[N];
for (int i = 0;i<N;++i){
cin >> S[i];
++mp[S[i]];
}
for (int i = 0; i < N; ++i)
{
if(S[i][0]=='!'){
S[i].erase(0, 1);
if(mp[S[i]]>=1){
cout << S[i];
return 0;
}
}
}
cout << "satisfiable" << endl;
} | #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 Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a = b;
}
}
int main()
{
int n;
cin >> n;
vector<string>s;
vector<string>ns;
rep(i,n){
string k;
cin >> k;
if(k[0] == '!'){
ns.push_back(k);
}
else{
s.push_back(k);
}
}
sort(s.begin(),s.end());
sort(ns.begin(),ns.end());
if(s.size() == 0 || ns.size() == 0){
cout << "satisfiable" << endl;
return 0;
}
rep(i,(int)s.size()){
int r = ns.size() -1;
int l = 0;
while(r - l >0){
int m = l + (r-l)/2;
string t = '!' + s[i];
if(t == ns[m]){
cout << s[i] << endl;
return 0;
}
else if(t < ns[m]){
r = m -1;
}
else if(t > ns[m]){
l = m + 1;
}
}
if('!' + s[i] == ns[l]){
cout << s[i] << endl;
return 0;
}
}
cout << "satisfiable" << endl;
return 0;
} |
/*
author: Maksim1744
created: 14.11.2020 15:06:23
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sum(a) ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a) (*min_element((a).begin(), (a).end()))
#define maxe(a) (*max_element((a).begin(), (a).end()))
#define mini(a) ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a) ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())
template<typename T> vector<T>& operator-- (vector<T>& v){for (auto& i : v) --i; return v;}
template<typename T> vector<T>& operator++ (vector<T>& v){for (auto& i : v) ++i; return v;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){for (auto& i : v) is >> i; return is;}
template<typename T> ostream& operator<<(ostream& os, vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second; return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}
#ifdef HOME
#define TAG_LENGTH 25
#define LR_LEFT left
#define LR_RIGHT right
#define LR_VALUE value
#define LR_SECOND_VALUE mn
#include "C:/C++ libs/print.cpp"
#else
#define showl 42;
#define shows 42;
#define show(...) 42;
#define showm(...) 42;
#define showt(...) 42;
#define printTree(...) 42;
#define printGraph(...) 42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug if (false)
#endif
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n;
cin >> n;
vector<vector<int>> g(n);
for (int i = 0; i < n; ++i) {
string s;
cin >> s;
for (int j = 0; j < n; ++j) {
if (s[j] == '1') {
g[j].pb(i);
}
}
}
ld ans = 0;
for (int i = 0; i < n; ++i) {
vector<int> u(n, false);
function<void(int)> dfs = [&](int v) {
u[v] = true;
for (auto k : g[v]) {
if (!u[k]) {
dfs(k);
}
}
};
dfs(i);
int sz = sum(u);
ans += 1.0l / sz;
}
cout << setprecision(20) << fixed << ans << '\n';
return 0;
}
| //#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (ll i = (a); i > (b); --i)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define SZ(a) ((ll)size(a))
#define print(x) cout << (x) << endl;
#define printn(x, n) \
rep(i, n) { cout << (x[i]) << " "; } \
cout << endl;
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pll;
void solve(long long t, long long N)
{
ll i;
i = 1;
ll tmp,tmp2,tmp3;
ll prev = 1;
ll num = 0;
vl v;
FOR(i, 1, 101)
{
tmp = ((100 + t) * i) / 100;
if (tmp > prev + 1)
{
num++;
v.push_back(tmp-1);
}
prev = tmp;
}
tmp=(N-1)/num;
tmp2=(N-1)%num;
print((100+t)*tmp+v[tmp2]);
}
int main()
{
long long t;
scanf("%lld", &t);
long long N;
scanf("%lld", &N);
solve(t, N);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const T &v : a) cerr << v << " ";
cerr << endl;
}
template <typename T>
void showVal(const vector<vector<T>> &a) {
cerr << endl;
for (const vector<T> &v : a) showVal(v);
}
#else
#define show(x)
#endif
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
multiset<int> s = {0};
ll sum = 0, ans = 0;
for (int i = 0; i < n; i++) {
int c = *s.rbegin();
s.insert(a[i]);
int b = *s.rbegin();
if (c < b) ans += (b - c) * i;
sum += a[i];
ans += sum + b;
show(sum);
show(b);
cout << ans << endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
//////////////////////////////////////////////////////////////////////////////
void files(){freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);}
void speed(){ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
int lcm(int a,int b){return (a*b)/__gcd(a,b);}
int fib(int n){return (pow(1+sqrt(5),n)-pow(1-sqrt(5),n))/(pow(2,n)*sqrt(5));}
const char* tochar(string a){return a.c_str();}
const int N = 1e5+5, M = 1e9+5;
bool used[1001];
//////////////////////////////////////////////////////////////////////////////
int main(){
int t;cin >> t;
while( t-- ){
long long n; cin >> n;
if ( !(n%2) && n%4 )cout << "Same\n";
else{
if( !(n%2) )cout << "Even\n";
else cout << "Odd\n";
}
}
}
|
#line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<ll,ll>
#define len(s) (ll)s.size()
template<class T> inline bool chmin(T &a, T b){
if(a>b){a=b;return true;}
return false;
}
template<class T> inline bool chmax(T &a, T b){
if(a<b){a=b;return true;}
return false;
}
constexpr ll inf = 3e18;
#line 2 "main.cpp"
int H,W;
char c[105][105];
int main(){
cin.tie(0);ios::sync_with_stdio(false);
cin>>H>>W;
rep(i,H)rep(j,W)cin>>c[i][j];
int ans=0;
rep(i,H)rep(j,W-1)if(c[i][j]=='.'&&c[i][j+1]=='.')ans++;
rep(i,H-1)rep(j,W)if(c[i][j]=='.'&&c[i+1][j]=='.')ans++;
cout<<ans<<"\n";
}
| #include <bits/stdc++.h>
using namespace std;
int n,q;
int c[200001];
int uf[200001];
vector <pair<int,pair<int,int>>> query;
map <int,int> cnt[200001];
int check[200001];
int find(int x)
{
if(uf[x] < 0)
{
return x;
}
return uf[x] = find(uf[x]);
}
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int total = 0;
memset(check,0,sizeof(check));
cin >> n >> q;
for(int i=1;i<=n;i++)
{
cin >> c[i];
}
for(int i=0;i<q;i++)
{
int a,b,c;
cin >> a >> b >> c;
query.push_back(make_pair(a,make_pair(b,c)));
if(a==2)
{
total++;
check[c]++;
}
}
for(int i=1;i<=n;i++)
{
if(check[c[i]]>0)
{
cnt[i][c[i]] = 1;
}
}
memset(uf,-1,sizeof(uf));
for(int i=0;i<q;i++)
{
if(total==0)
{
break;
}
if(query[i].first==1)
{
int u = query[i].second.first;
int v = query[i].second.second;
int t;
if(u > v)
{
t = u;
u = v;
v = t;
}
//u = uf[u];
//v = uf[v];
u = find(u);
v = find(v);
if(u!=v)
{
uf[v] = u;
//cout << u << ' ' << v << '\n';
for(auto it : cnt[v])
{
if(check[it.first]==0)
{
continue;
}
cnt[u][it.first] += it.second;
}
cnt[v].clear();
}
}
else
{
int x = query[i].second.first;
int y = query[i].second.second;
long long int g = find(x);
long long int res = cnt[g][y];
cout << res << '\n';
check[y]--;
total--;
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)
template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}
const char newl = '\n';
ll const mod = 1e9+7;
int main() {
int q;
cin >> q;
while (q--) {
ll n,a,b;
cin >> n >> a >> b;
ll ans = 0,c = (n-a+1)*(n-b+1)%mod,d = (n-a-b+1)*(n-a-b+2)%mod;
ans = c*c%mod-(c-d)*(c-d)%mod;
if (a+b > n) ans = 0;
cout << (ans+mod)%mod << newl;
}
} | #include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<60);
template <unsigned long long mod > class modint{
public:
ll x;
constexpr modint(){x = 0;}
constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}
constexpr modint set_raw(ll _x){
//_x in [0, mod)
x = _x;
return *this;
}
constexpr modint operator-(){
return x == 0 ? 0 : mod - x;
}
constexpr modint& operator+=(const modint& a){
if((x += a.x) >= mod) x -= mod;
return *this;
}
constexpr modint operator+(const modint& a) const{
return modint(*this) += a;
}
constexpr modint& operator-=(const modint& a){
if((x -= a.x) < 0) x += mod;
return *this;
}
constexpr modint operator-(const modint& a) const{
return modint(*this) -= a;
}
constexpr modint& operator*=(const modint& a){
(x *= a.x)%=mod;
return *this;
}
constexpr modint operator*(const modint& a) const{
return modint(*this) *= a;
}
constexpr modint pow(unsigned long long pw) const{
modint res(1), comp(*this);
while(pw){
if(pw&1) res *= comp;
comp *= comp;
pw >>= 1;
}
return res;
}
//以下、modが素数のときのみ
constexpr modint inv() const{
if(x == 2) return (mod + 1) >> 1;
return modint(*this).pow(mod - 2);
}
constexpr modint& operator/=(const modint &a){
(x *= a.inv().x)%=mod;
return *this;
}
constexpr modint operator/(const modint &a) const{
return modint(*this) /= a;
}
};
#define mod2 1000000007
using mint = modint<mod2>;
ostream& operator<<(ostream& os, const mint& a){
os << a.x;
return os;
}
using vm = vector<mint>;
int main() {
cin>>Q;
rep(_, Q){
cin>>N>>A>>B;
if(A < B) swap(A, B);
ll m = min(B - 1, N - A);
mint res(0);
mint da(N - A + 1), db(N - B + 1), d(A - B + 1);
mint sum = N - A + N - A + 1 - m;
(sum *= m) *= (mod2 + 1) >> 1;
res += da * da * (db * db - d * d);
res -= sum * (d * da + sum) * 4;
cout<<res<<endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=35;
int t,n,m;
ll a,b,k;
ll f[N][N];
string finds(ll a,ll b,ll k){
if(!a) return string(b,'b');
if(!b) return string(a,'a');
if(f[a-1][b] >= k) return "a" + finds(a-1,b,k);
else return "b" + finds(a,b-1,k-f[a-1][b]);
}
int main(){
cin>>a>>b>>k;
f[0][0] = 1;
for(int i=0;i<=a;i++)
for(int j=0;j<=b;j++){
if(i) f[i][j] += f[i-1][j];
if(j) f[i][j] += f[i][j-1];
}
cout<<finds(a,b,k)<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <cassert>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 2e18;
const ll fact_table = 3200008;
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop
ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
//↓,→,↑,←
/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
// const ll mod = 998244353ll;
// const ll mod = 1000000007ll;
// ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];
void c3_init() {
fact[0] = rfact[0] = 1;
for (ll i = 1; i <= fact_table; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
for (ll i = fact_table; i >= 1; i--) {
rfact[i - 1] = rfact[i] * i;
rfact[i - 1] %= mod;
}
return;
}
ll c3(ll n, ll r) {
return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
bool multicase = false;
// ACLにするのを忘れない
ll mod;
ll dp[105][1000405];
void solve() {
ll n, k;
cin >> n >> k >> mod;
dp[0][0] = 1ll;
for (ll i = 1; i <= n; i++) {
ll maxi = i * i * k + 100ll;
for (ll j = 0; j <= maxi; j++) {
ll value = (j - i >= 0) ? (dp[i][j - i]) : 0ll;
value += dp[i - 1][j];
value %= mod;
if (j >= i * k + i) value += mod - dp[i - 1][j - i * k - i];
value %= mod;
dp[i][j] = value;
}
}
for (ll i = 1; i <= n; i++) {
// answer query i
ll maxi = 1000000ll;
ll ans = 0;
for (ll j = 0; j <= maxi; j++) {
ans += (dp[n - i][j] * dp[i - 1][j]) % mod;
ans %= mod;
}
ans *= (k + 1ll);
ans %= mod;
ans += mod - 1ll;
ans %= mod;
p(ans);
}
return;
}
int main() {
// init();
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll q, testcase = 1;
if (multicase) {
cin >> q;
} else {
q = 1;
}
while (q--) {
// pu("Case ");pu("#");pu(testcase);pu(": ");
solve();
testcase++;
}
// solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.first>>v.second;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>T dup(T x, T y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
int keta(ll n) { int ret = 0; while (n>0) { n/=10; ret++; } return ret; }
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) { cerr << head; dump(); }
template <typename Head, typename... Tail> void dump(Head &&head, Tail &&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do { cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
const ll LINF = 1LL << 60;
const int INF = 1001001001;
/////////////////////////////////////////////////////////////////////
void solve()
{
int n; cin>>n;
ll mi = -LINF;
ll ma = LINF;
ll fl = 0;
rep(i, n) {
ll a,t; cin>>a>>t;
if (t == 1) {
mi += a;
ma += a;
fl += a;
}
if (t == 2) {
maxs(mi, a);
maxs(ma, mi);
}
if (t == 3) {
mins(ma, a);
mins(mi, ma);
}
}
mi -= fl;
ma -= fl;
int q; cin>>q;
vector<ll> x(q); cin>>x;
rep(i, q) {
ll v = x[i];
mins(v, ma);
maxs(v, mi);
cout << v+fl << "\n";
}
}
int main()
{
int t;
t = 1;
// cin>>t;
while (t--) solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
ll H, W;
string A[2005];
bool vv[2005][2005];
pair<ll, ll> memo[2005][2005];
//ここに飛んできたやつを先手とする
//先手が取れる点数, 後て
pair<ll, ll> dfs(ll y, ll x) {
if(vv[y][x]) return memo[y][x];
if(y == H - 1 && x == W-1) {
if(y == 0 && x == 0) {
return make_pair(0, 0);
} else if(A[y][x] == '+') {
return make_pair(1, 0);
} else {
return make_pair(-1, 0);
}
}
pair<ll, ll> ret;
if(y == H-1) {
auto tmp = dfs(y, x+1);
ret = make_pair(tmp.second, tmp.first);
} else if(x == W-1) {
auto tmp = dfs(y+1, x);
ret = make_pair(tmp.second, tmp.first);
} else {
auto tmp0 = dfs(y, x+1);
auto tmp1 = dfs(y+1, x);
if(tmp0.first - tmp0.second> tmp1.first - tmp1.second) {
ret = make_pair(tmp0.second, tmp0.first);
} else {
ret = make_pair(tmp1.second, tmp1.first);
}
}
if(y != 0 || x != 0) {
if(A[y][x] == '+') {
ret.first++;
} else {
ret.first--;
}
}
vv[y][x] = true;
memo[y][x] = ret;
return ret;
}
int main(){
cin >> H >> W;
rep(i, H) cin >> A[i];
auto item = dfs(0, 0);
if(item.first == item.second) {
cout << "Draw" << endl;
} else if(item.first > item.second) {
cout << "Aoki" << endl;
} else {
cout << "Takahashi" << endl;
}
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main() {
long n, temp = 0;
string s;
stack<char> st;
cin >> n >> s;
if(n >= 3) {
st.push(s.at(0));
st.push(s.at(1));
rep(i, n - 2) {
if(st.size() < 2) {
st.push(s.at(i + 2));
continue;
}
char a = st.top();
st.pop();
char b = st.top();
st.pop();
if(b == 'f' && a == 'o' && s.at(i + 2) == 'x') {
temp += 3;
} else {
st.push(b);
st.push(a);
st.push(s.at(i + 2));
}
}
}
long ans = n - temp;
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <time.h>
#include <math.h>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
typedef vector<pii > vii;
typedef vector<vector<ll> > vvi;
typedef vector<vvi > vvvi;
typedef vector<vector<pair<ll, ll> > > vvii;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,s,e) for(ll i=(s);i<(e);++i)
#define repr(i,s,e) for(ll i=(e);i>(s);--i)
#define io ios::sync_with_stdio(false)
#define prv(v) \
do \
{ \
for(auto it = (v).begin(); it != (v).end(); ++it) cerr << *it << " "; \
cerr << endl; \
} while (0);
#define prm(m) \
do \
{ \
for (auto it = (m).begin(); it != (m).end(); ++it) \
cerr << it->first << " -> " << it->second << endl; \
} while (0);
const ll MOD = 1e9+7;
const ll INF = 1e14;
const ll TE3 = 1005;
const ll TE5 = 300005;
const string YN[2] = {"NO", "YES"};
using namespace std;
int main()
{
io;
ll n;
string s;
cin >> n >> s;
stack<char> u;
rep(i,0,n) {
char c = s[i];
if(u.size()<2) {
u.push(c);
} else {
if(c!='x') {
u.push(c);
} else {
char b = u.top();
u.pop();
char a = u.top();
u.pop();
if(a == 'f' && b == 'o') {
} else {
u.push(a);
u.push(b);
u.push(c);
}
}
}
}
cout << u.size() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, ans=0;
cin >> n;
char s[n+1];
int a[n+1], t[n+1], c[n+1], g[n+1];
for (int i=1; i<=n; i++){
cin >> s[i];
a[i]=t[i]=c[i]=g[i]=0;
}
a[0]=t[0]=c[0]=g[0]=0;
for (int i=1; i<=n; i++){
a[i]=a[i-1], t[i]=t[i-1], c[i]=c[i-1], g[i]=g[i-1];
if (s[i]=='A') a[i]++;
if (s[i]=='T') t[i]++;
if (s[i]=='C') c[i]++;
if (s[i]=='G') g[i]++;
}
for (int i=1; i<n; i++)
for (int j=i+1; j<=n; j++)
if (a[j]-a[i-1]==t[j]-t[i-1]&&c[j]-c[i-1]==g[j]-g[i-1]) ans++;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define int long long
using namespace std;
const ll INF = 1e18;
const ll MOD = 998244353;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
#ifdef MODULAR
void __print(mint x) {cerr << x;}
#endif
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");}
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...);}
#ifdef XOX
#define deb(x...) cerr << "Line (" << __LINE__ << ") : " << "[" << #x << "] = [", _print(x)
#else
#define deb(x...)
#endif
int32_t main() {
ios::sync_with_stdio(!cin.tie(NULL));
int n;
cin >> n;
string s;
cin >> s;
char ch;
int ans = 0;
bool found;
int a = 0, g = 0, c = 0, t = 0;
for(int i = 0; i < n; i++) {
int ptr = 0;
a = g = c = t = 0;
for(int j = i; j < n; j++) {
if(s[j] == 'A') ch = 'T', a++;
else if(s[j] == 'G') ch = 'C', g++;
else if(s[j] == 'C') ch = 'G', c++;
else if(s[j] == 'T') ch = 'A', t++;
if(a == t and c == g) ans++;
deb(i, j, a, t, g, c);
//found = false;
//while(ptr < n and !found) {
//ptr++;
//if(s[ptr - 1] == ch) found = true;
//}
//deb(i, j, ptr, found, ch);
//if(!found) break;
//else ans++;
}
}
cout << ans;
}
|
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any other key word
#include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
using namespace std;
#define Fio \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr)
#define ll long long int
#define fo(i, a, b) for (long long int i = a; i <= b; i++)
#define w(t) \
int t; \
cin >> t; \
while (t--)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#define vl vector<long long int>
#define vvi vector<vector<int>>
#define vvl vector<vector<long long int>>
#define mii map<int, int>
#define umii unordered_map<int, int>
#define mll map<ll,ll>
#define umll unordered_map<ll,ll>
#define newl cout<<"\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
const ll inf = 1e9;
const ll mod = 998244353;
#define MAX 305
ll mini(ll a,ll b){
if(a>=b)return b;
return a;
}
ll maxi(ll a,ll b){
if(a>=b)return a;
return b;
}
int main(){
Fio;
string s;
cin>>s;
fo(i,1,s.length()-1)cout<<s[i];
cout<<s[0];
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
int len = s.size();
for(int i = 1; i < len; i++) cout << s[i];
cout << s[0] << endl;
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const int MAX=INT_MAX;
//const ll MAX=100000000000;
//const int mod = 1000000007;
//const int mod = 998244353;
//const ll A=100000000000;
const int INF=1000000000;
ll extgcd(ll a,ll b,ll& x,ll& y){
if(b==0){
x=1;
y=0;
return a;
}else{
ll d =extgcd(b,a%b,x,y);
ll prv=x;
x=y;
y=prv-a/b*y;
return d;
}
}
int main(){
int T;
cin>>T;
ll N,S,K;
for(int t=0;t<T;t++){
cin>>N>>S>>K;
ll x=0;
ll y=0;
ll g=extgcd(N,-K,x,y);
if(S%g!=0){
cout<<-1<<endl;
}else{
ll s=S/g;
ll n=N/g;
ll k=K/g;
ll nx=x*s;
ll ny=y*s;
// cout<<"ny:"<<ny<<"n:"<<n<<endl;
ll t;
if(n>0){
if(-double(ny)/double(n)<0){
t=-ny/n;
}else{
t=-ny/n+1;
}
}else{
if(-double(ny)/double(n)<0){
t=-ny/n-1;
}else{
t=-ny/n;
}
}
// cout<<t<<endl;
ll ans=n*t+ny;
// cout<<g<<":"<<s<<":"<<x<<":"<<y<<":"<<ans<<endl;
cout<<ans<<endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
typedef pair<int, int> P;
int main()
{
int N;
cin >> N;
vector<double> x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
rep(i, N) {
repd(j, i + 1, N) {
repd(k, j + 1, N) {
double l = (y[j] - y[i]) * (x[k] - x[i]);
double r = (y[k] - y[i]) * (x[j] - x[i]);
if (r == l) {
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
const int MN = 2020;
const ll M = 1e9+7;
inline ll mul(ll a, ll b) {
return (a*b)%M;
}
ll bp(ll b, ll p) {
ll ac = 1;
while(p) {
if(p&1) {
ac = mul(ac,b);
}
b = mul(b,b);
p >>= 1;
}
return ac;
}
ll prf[MN*MN];
ll fac(ll val) {
if(val <= 1) {return 1;}
if(prf[val] != -1) {return prf[val];}
prf[val] = mul(fac(val-1),val);
return prf[val];
}
ll inv(ll val) {
return bp(val,M-2);
}
ll ch(ll n, ll k) {
ll num = 1;
for(ll i=0;i<k;i++) {
num = mul(num,n-i);
}
ll dem = fac(k);
return mul(num,inv(dem));
}
vl w;
int main() {
memset(prf,-1,sizeof(prf));
ll n,m;
cin >> n >> m;
ll su = 0;
for(int i=0;i<n;i++) {
ll a;
cin >> a;
w.push_back(a);
su += a;
}
su += n;
m += n;
cout << ch(m,su) << '\n';
}
| // Problem: D - Binomial Coefficient is Fun
// Contest: AtCoder - AtCoder Regular Contest 110（Sponsored by KAJIMA CORPORATION）
// Time: 2020-12-14 00:33:52
// 私に忍び寄るのをやめてください、ありがとう
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define int long long
#define mod 1000000007 //998244353
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define f(i,n) for(ll i=0;i<n;i++)
#define fore(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define nl "\n"
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define x first
#define y second
#define vc vector
#define pb push_back
#define ar array
#define all(a) (a).begin(), (a).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ms(v,n,x) fill(v,v+n,x);
#define init(c,a) memset(c,a,sizeof(c))
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define sll set<ll>
#define vll vector<ll>
#define vpll vector<pll>
#define inf 9e18
#define cases ll T;cin>>T;while(T--)
#define BLOCK 500
//const double PI = 3.141592653589793238460;
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
typedef std::complex<double> Complex;
typedef std::valarray<Complex> CArray;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
// void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long 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");}
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
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int power(int a,int b){
int res = 1;
while(b){
if(b&1){
res = res*a;
res %= mod;
}
a=a*a;
a%=mod;
b=b/2;
}
return res;
}
int inverse(int x){
return power(x,mod-2);
}
int const N = 5e6+55;
int fact[N], ifact[N];
void precompute(){
fact[0] = 1;
for(int i=1;i<N;i++){
fact[i] = fact[i-1]*i;
fact[i] %= mod;
}
ifact[N-1] = inverse(fact[N-1]);
for(int i=N-2;i>=0;i--){
ifact[i] = (i+1)*ifact[i+1];
ifact[i] %= mod;
}
}
ll ncr(ll x,ll y){
ll now=x,ans=1;
now%=mod;
f(i,y){
ans=ans*now%mod;
now=(now-1+mod)%mod;
//if(now<0)return 0;
}
ans=ans*ifact[y]%mod;
return ans;
}
int32_t main()
{
fast
cout << fixed << setprecision(12);
ll n,m;
cin>>n>>m;
precompute();
vll a(n);
ll s=0;
f(i,n){
cin>>a[i];
s+=a[i];
}
cout<<ncr(m+n,s+n);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
//first second
//memset(dp, -1, sizeof dp);
struct keycompare {
bool operator()(const pair<ll, ll>& v, const ll& k) {
return (v.first < k);
}
bool operator()(const ll& k, const pair<ll, ll>& v) {
return (k < v.first);
}
};
ll mod1=998244353,mod2=1000000007,limit=9223372036854775807;
long double pi=3.1415926535897932;
ll modpow(ll x, ll n, ll m) {
if(x>m){
x%=m;
}
if (n == 0) return 1%m;
ll u = modpow(x,n/2,m);
u = (u*u)%m;
if (n%2 == 1) u = (u*x)%m;
return u;
}
ll gcd(ll a, ll b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
bool isprime(ll n){
if(n==2)
return true;
for(ll i=2;i*i<=n;i++){
if(n%i==0)
return false;
}
return true;
}
ll power(ll x,ll n){
ll x_n=1;
for(ll i=0;i<n;i++){
x_n*=x;
}
return x_n;
}
ll pre[200005][305];
ll fact[305], inverse[305];
int ncr(int n,int r){
ll ans=(fact[n]*inverse[r])%mod1;
ans=(ans*inverse[n-r])%mod1;
return ans;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fact[0]=1,inverse[0]=1;
for(int i=1;i<305;i++){
fact[i]=(fact[i-1]*i)%mod1;
inverse[i]=modpow(fact[i],mod1-2,mod1);
}
int n,k; cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
pre[i][0]=1;
}
ll tempo[k+1]={0};
tempo[0]=n;
for(int i=0;i<n;i++){
for(int j=1;j<=k;j++){
pre[i][j]=(pre[i][j-1]*arr[i])%mod1;
tempo[j]=(tempo[j]+pre[i][j])%mod1;
}
}
int check=modpow(2,mod1-2,mod1);
for(int x=1;x<=k;x++){
ll result=0;
for(int p=0;p<=x;p++){
ll tempans=(tempo[x-p]*tempo[p])%mod1;
tempans=(tempans*ncr(x,p))%mod1;
result=(result+tempans)%mod1;
}
result=(result-(modpow(2,x,mod1)*tempo[x]))%mod1;
result=(result*check)%mod1;
cout<<(result+mod1)%mod1<<"\n";
}
cout<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using P = pair<int,int>;
const int INF=1001001001;
const int mod =998244353;
struct mint {
ll x;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { 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(ll 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, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
struct combination {
vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
} c(200005);
int main() {
ll N,K;
cin>>N>>K;
vector<mint>A(N);
rep(i,N){
int a;
cin>>a;
A[i]=a;
}
vector<mint>sum(K+1);
rep(i,N){
mint ki=1;
rep(k,K+1){
sum[k]=(sum[k]+ki);
ki=ki*A[i];
}
}
for(int x=1;x<=K;x++){
mint ans=0;
rep(k,x+1){
ans+=c(x,k)*sum[k]*sum[x-k];
}
mint p=mint(2).pow(x)*sum[x];
cout<<(ans-p)/2<<endl;
}
return 0;
}
|
#include<cstdio>
int n;
int w[105];
int dp[105][21000];
int ndp[105][21000];
int mod = 998244353;
int dpbase = 10500;
long long int fct[105];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &w[i]);
}
dp[0][dpbase] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
for (int k = dpbase - 100 * i; k <= dpbase + 100 * i; k++) {
ndp[j][k - w[i]] += dp[j][k];
ndp[j][k - w[i]] %= mod;
ndp[j + 1][k + w[i]] += dp[j][k];
ndp[j + 1][k + w[i]] %= mod;
}
}
for (int j = 0; j <= (i + 1); j++) {
for (int k = dpbase - 100 * (i + 1); k <= dpbase + 100 * (i + 1); k++) {
dp[j][k] = ndp[j][k];
ndp[j][k] = 0;
}
}
}
fct[0] = 1;
for (int i = 1; i <= n; i++) {
fct[i] = fct[i - 1] * i%mod;
}
long long int ans = 0;
for (int i = 0; i <= n; i++) {
ans += dp[i][dpbase] * fct[i] % mod*fct[n - i] % mod;
ans %= mod;
}
printf("%lld\n", ans);
return 0;
}
| #include<bits/stdc++.h>
typedef unsigned long long ull;
typedef long long ll;
#define inf 0x3f3f3f3f
#define rep(i,l,r) for(int i=l;i<=r;i++)
#define nep(i,r,l) for(int i=r;i>=l;i--)
void sc(int &x){scanf("%d",&x);}
void sc(int &x,int &y){scanf("%d%d",&x,&y);}
void sc(int &x,int &y,int &z){scanf("%d%d%d",&x,&y,&z);}
void sc(ll &x){scanf("%lld",&x);}
void sc(ll &x,ll &y){scanf("%lld%lld",&x,&y);}
void sc(ll &x,ll &y,ll &z){scanf("%lld%lld%lld",&x,&y,&z);}
void sc(char *x){scanf("%s",x);}
void sc(char *x,char *y){scanf("%s%s",x,y);}
void sc(char *x,char *y,char *z){scanf("%s%s%s",x,y,z);}
void out(int x){printf("%d\n",x);}
void out(ll x){printf("%lld\n",x);}
void out(int x,int y){printf("%d %d\n",x,y);}
void out(ll x,ll y){printf("%lld %lld\n",x,y);}
void out(int x,int y,int z){printf("%d %d %d\n",x,y,z);}
void out(ll x,ll y,ll z){printf("%lld %lld %lld\n",x,y,z);}
using namespace std;
const int N=105,mod=998244353;
int n,a[N],dp[N][N*N];
ll f[N];
int main()
{
f[0]=1;
rep(i,1,N-1) f[i]=f[i-1]*i%mod;
sc(n);
int sum=0;
rep(i,1,n) sc(a[i]),sum+=a[i];
if(sum&1) {out(0);return 0;}
sum/=2;
dp[0][0]=1;
int s=0;
for(int i=1;i<=n;i++)
{
for(int j=i-1;j>=0;j--)
for(int k=s;k>=0;k--)
dp[j+1][k+a[i]]=(dp[j+1][k+a[i]]+dp[j][k])%mod;
s+=a[i];
}
ll ans=0;
for(int i=1;i<=n;i++) ans=(ans+dp[i][sum]*f[i]%mod*f[n-i]%mod)%mod;
out(ans);
}
|
// どこが間違っているか分からない時は,簡単なミス(型,スペル,入力or出力など)をしていたり問題文の見落としがあったりする. 一度落ち着いて頭をリセットしよう.
// 計算途中のオーバーフローに注意しよう
#include "bits/stdc++.h"
#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=(n); i--)
#define LREP(lst,itr) for(auto itr = lst.begin(); itr != lst.end(); ++itr)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#define P(s) cout<<(s)<<endl
#define P2(a, b) cout<<(a)<<" "<<(b)<<endl
#define P3(a, b, c) cout<<(a)<<" "<<(b)<<" "<<(c)<<endl
#define PP(val, pre) cout<<fixed<<setprecision(pre)<<val<<endl
#define V2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
// nの約数を全て求める O(√N)
// argument : 約数を求めたい数字
// return : 約数の昇順ベクター
vector<ll> divisor(ll n){
vector<ll> result;
for(ll i=1;i*i <= n;i++){
if(n%i==0){
result.push_back(i);
if((n/i)==i)continue;
result.push_back(n/i);
}
}
sort(result.begin(), result.end());
return result;
}
int main(){
int N;
cin >> N;
vector<ll> vec;
vec.push_back(1);
REP(i, 2, N+1){
vector<ll> div = divisor(i);
div.pop_back();
ll maxi = 0;
for(auto d : div){
maxi = max(maxi, vec[d-1]);
}
vec.push_back(maxi+1);
}
REP(i, 0, vec.size()){
if(i!=0) cout << " ";
cout << vec[i];
}
cout << endl;
} | /*..................................
"Be not afraid of GROWING slowly, be afraid only of Standing Still"
....................................*/
#include <bits/stdc++.h>
using namespace std;
# define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define amin(a,b) a=min(a,b)
#define amax(a,b) a=max(a,b)
#define space " "
#define ain(arr) for(int i=0;i<n;i++)cin>>arr[i];
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i = a;i>=b;i--)
#define rsort(a) sort(a.begin(),a.end(),greater<int>())
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define maxq(x) priority_queue<x>
#define minq(x) priority_queue<x,vector<x>,greater<x>>
#define ppb pop_back
#define ppf pop_front
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define pii pair<int,int>
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
#define endl "\n"
#define MOD 1000000007
#define LINF (1LL<<60)
#define INF 2147483647
#define PI 3.1415926535897932384626433
#define testcase int t; cin>>t; while(t--)
bool isvowel(char c) {if (c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' || c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U')return true; return false;}
bool prime[5000001];
int spf[5000001]; //contains smallest prime factor of i, spf[i]=0 means i is prime
vector<int> primes;
void sieve() {memset(prime, true, sizeof(prime)); for (int p = 2; p * p <= 5000000; p++) {if (prime[p] == true) {for (int i = p * p; i <= 5000000; i += p) {prime[i] = false; if (spf[i] == 0)spf[i] = p;}}} for (int p = 2; p <= 5000000; p++)if (prime[p])primes.push_back(p);}
ll gcd(ll a, ll b) {if (b == 0)return a; return gcd(b, a % b);}
ll fast_exp(ll x, ll n) {ll ans = 1; while (n) {if (n & 1)ans *= x; n = n >> 1; x = x * x;} return ans;}
ll mod_exp(ll x, ll y, ll p) {ll res = 1; x = x % p; while (y > 0) {if (y & 1)res = (res * x) % p; y = y >> 1; x = (x * x) % p;} return res;}
ll power(ll x, ll y) {ll temp; if ( y == 0) return 1; temp = power(x, y / 2); if (y % 2 == 0) return temp * temp; else return x * temp * temp;}
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void solve()
{
ll n;
cin >> n;
ll a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
ll maximum[n];
maximum[0] = a[0];
for (int i = 1; i < n; i++)
{
maximum[i] = max(a[i], maximum[i - 1]);
}
ll prefixSum[n];
prefixSum[0] = a[0];
for (int i = 1; i < n; i++)
{
prefixSum[i] = prefixSum[i - 1] + a[i];
}
ll answer = 0;
for (int i = 0; i < n; i++)
{
answer += prefixSum[i];
cout << answer + (i + 1)*maximum[i] << endl;
}
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "r", stdout);
freopen("error.txt", "r", stderr);
#endif
fast
solve();
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
int N, M;
int to[400005], ne[400005], c[200005], he[100001];
int kotae[100001];
const int CM = 1 << 17, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 72 - dig >> 3;
return tmp;
}
const int MAX = 1000;
class shuturyoku_unko {
public:
char C[MAX * 4];
constexpr shuturyoku_unko() : C() {
rep(i, MAX) {
int X = i;
rep(j, 3) {
C[i * 4 + 2 - j] = '0' + X % 10;
X /= 10;
}
C[i * 4 + 3] = ' ';
}
}
};
constexpr shuturyoku_unko f;
const int dm = 1 << 17;
char* dn = cn, * di = dn, * owad = dn + dm - 20;
void putint(int A) {
if (owad < di) {
fwrite(dn, 1, di - dn, stdout);
di = dn;
}
if (A >= 1000) {
int dig = 1;
if (A >= 100000) dig = 3;
else if (A >= 10000) dig = 2;
memcpy(di, f.C + A / 1000 * 4 + 3 - dig, dig);
memcpy(di + dig, f.C + A % 1000 * 4, 4);
di += dig + 4;
}
else {
int dig = 1;
if (A >= 100) dig = 3;
else if (A >= 10) dig = 2;
memcpy(di, f.C + A * 4 + 3 - dig, dig + 1);
di += dig + 1;
}
}
int main() {
//cin.tie(0);
//ios::sync_with_stdio(false);
N = getint();
M = getint();
int k = 2;
rep1(i, M) {
int u = getint(), v = getint();
c[i] = getint();
to[k] = v;
ne[k] = he[u];
he[u] = k++;
to[k] = u;
ne[k] = he[v];
he[v] = k++;
}
int Q[100001], q = 0;
Q[q++] = 1;
kotae[1] = 1;
while (q) {
int tmp = Q[--q];
int oya = kotae[tmp];
for (int k = he[tmp]; k; k = ne[k]) {
int t = to[k];
if (!kotae[t]) {
int e = c[k >> 1];
kotae[t] = e + (oya == e);
Q[q++] = t;
}
}
}
rep1(i, N) putint(kotae[i] - ((kotae[i] > N) << 1));
fwrite(dn, 1, di - dn, stdout);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
constexpr ll MOD=998244353;
int main() {
int n,m;
cin >> n >> m;
vector<vector<pair<int,int>>> ee(n,vector<pair<int,int>>(0));
rep(i,m){
int f,g,h;
cin >> f >> g >> h;
f--;
g--;
ee[f].push_back(mk(g,h));
ee[g].push_back(mk(f,h));
}
vector<int> d(n,0);
d[0]=1;
vector<vector<pair<int,int>>> e(n,vector<pair<int,int>>(0));
vector<set<int>> s(n);
queue<int> q;
q.push(0);
while(!q.empty()){
int f=q.front();
q.pop();
rep(i,ee[f].size()){
if (d[ee[f][i].first]==0){
d[ee[f][i].first]=1;
e[f].push_back(mk(ee[f][i].first,ee[f][i].second));
e[ee[f][i].first].push_back(mk(f,ee[f][i].second));
s[f].insert(ee[f][i].second);
s[ee[f][i].first].insert(ee[f][i].second);
q.push(ee[f][i].first);
}
}
}
queue<pair<int,int>> qq;
vector<int> dd(n,0),ans(n,0);
qq.push(mk(0,0));
dd[0]=1;
while(!qq.empty()){
int f=qq.front().first,g=qq.front().second;
qq.pop();
if (g==0){
for (int i=1;i<=n;i++){
if (s[f].find(i)==s[f].end()){
ans[f]=i;
break;
}
}
rep(i,e[f].size()){
if (dd[e[f][i].first]==0){
dd[e[f][i].first]=1;
qq.push(mk(e[f][i].first,e[f][i].second));
}
}
}
else{
ans[f]=g;
rep(i,e[f].size()){
if (dd[e[f][i].first]==0){
dd[e[f][i].first]=1;
if (g!=e[f][i].second) qq.push(mk(e[f][i].first,e[f][i].second));
else qq.push(mk(e[f][i].first,0));
}
}
}
}
rep(i,n) cout << ans[i] << endl;
}
|
// abc188_e
#include <bits/stdc++.h>
#ifdef LOCAL
#include "../cxx-prettyprint/prettyprint.hpp"
#endif
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))
#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))
#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))
#define ALL(x) x.begin(), x.end()
#define INF (ll)(1e15)
#define MOD (1000000007)
#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << " "; cout << endl; }
#define print_line(vec, n) {for(int idx=0;idx<(n-1);idx++) cout << (vec)[idx] << " "; cout << (vec)[(n)-1] << endl;}
template<class T> void print(const T& x){cout << x << "\n";}
template<class T, class... A> void print(const T& first, const A&... rest) { cout << first << " "; print(rest...); }
struct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;
struct Graph {
int n;
vector<vector<int>> edges;
vector<set<int>> rev;
vector<ll> weight;
vector<ll> mn;
Graph(int n): n(n), edges(n), rev(n), weight(n), mn(n, INF){}
void add_edge(int u, int v){
edges[u].emplace_back(v);
rev[v].emplace(u);
}
ll dfs(){
queue<int> q;
REP(i, n){
if (rev[i].empty()) q.push(i);
}
ll ret=-INF;
while (!q.empty()){
int u = q.front(); q.pop();
for (auto v: edges[u]){
ret = max(ret, weight[v] - mn[u]);
mn[v] = min(mn[v], mn[u]);
rev[v].erase(u);
if (rev[v].empty()){
q.push(v);
}
}
}
return ret;
}
};
int main() {
#ifdef LOCAL
ifstream in("../arg.txt"); cin.rdbuf(in.rdbuf());
#endif
int N, M;
cin >> N >> M;
Graph g(N);
REP(i, N) {
cin >> g.weight[i];
g.mn[i] = g.weight[i];
}
REP(i, M){
int x, y; cin >> x >> y; x--;y--;
g.add_edge(x, y);
}
ll ans = g.dfs();
print(ans);
return 0;
}
| #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m;
int arr[200010];
vector<int> v[200010];
int come[200010];
int sell[200010];
int mn[200010];
int main()
{
int i;
int a, b;
queue<int> que;
int cur;
int nxt;
int ans;
cin >> n >> m;
for (i = 1; i <= n; i++)
{
cin >> arr[i];
}
for (i = 0; i < m; i++)
{
cin >> a >> b;
v[a].push_back(b);
come[b]++;
}
for (i = 1; i <= n; i++)
{
sell[i] = -2000000010;
mn[i] = arr[i];
if (!come[i]) que.push(i);
}
while (!que.empty())
{
cur = que.front();
que.pop();
for (i = 0; i < v[cur].size(); i++)
{
nxt = v[cur][i];
come[nxt]--;
sell[nxt] = max(sell[nxt], arr[nxt] - mn[cur]);
mn[nxt] = min(mn[nxt], mn[cur]);
if (!come[nxt]) que.push(nxt);
}
}
ans = -2000000010;
for (i = 1; i <= n; i++)
{
ans = max(ans, sell[i]);
}
cout << ans;
} |
//int max = 2 147 483 647 (2^31-1)
//ll max = 9 223 372 036 854 775 807 (2^63-1)
#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define MOD 1000000007
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pi;
//Fast input and output
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);}
//Printing pairs and vectors
template<typename A, typename B> ostream& operator<< (ostream &cout, pair<A,B> const &p) {return cout << "(" << p.f << ", " << p.s << ")";}
template<typename A> ostream& operator<< (ostream &cout, vector<A> const&v){
cout << "["; forn(i,(int)v.size()){ if (i) cout << ", "; cout << v[i];} return cout << "]";}
ll mpow(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp % 2 == 1){
res = (res * base) % MOD;
}
exp >>= 1;
base = (base * base) % MOD;
}
return res;
}
ll minv(ll base) {
return mpow(base, MOD - 2);
}
int main(){
fast_io();
int n,m,k; cin >> n >> m >> k;
vi a(n);
forn(i,n) cin >> a[i];
vi bina;
ll b=k;
while(k>0){
bina.pb(k%2); k>>=1;}
int p=bina.size();
for(int i=0;i<p/2;i++) swap(bina[i],bina[p-1-i]);
vector<vl>one(n,vl(n));
forn(i,n) one[i][i]=2*m;
forn(i,m){
int x,y; cin >> x >> y;
one[x-1][x-1]--;
one[y-1][y-1]--;
one[x-1][y-1]++;
one[y-1][x-1]++;
}
vector<vl>dp(n,vl(n));
forn(i,n) dp[i][i]=1;
forn(l,p){
vector<vl>newdp(n,vl(n));
forn(i,n){
forn(j,n){
forn(t,n){
newdp[i][t]=(newdp[i][t]+dp[i][j]*dp[j][t])%MOD;
}
}
}
dp=newdp; newdp=vector<vl>(n,vl(n));
if(bina[l]){
forn(i,n){
forn(j,n){
forn(t,n){
newdp[i][t]=(newdp[i][t]+one[i][j]*dp[j][t])%MOD;
}
}
}
dp=newdp;
}
}
vl ans(n);
forn(i,n){
forn(j,n){
ans[i]=(ans[i]+dp[i][j]*a[j])%MOD;
}
ans[i]=(ans[i]*minv(mpow(2*m,b)))%MOD;
}
forn(i,n) cout << ans[i] << "\n";
}
//code by DanTheMan
| // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define eq equal_range
#define fs first
#define ss second
#define ins insert
#define mkp make_pair
#define endl "\n"
using namespace std;
typedef vector<ll> vll;
typedef vector<int> vin;
typedef vector<char> vch;
typedef vector<string> vst;
typedef set<ll> sll;
typedef set<int> sint;
typedef set<char> sch;
typedef set<string> sst;
typedef queue<ll> qll;
typedef queue<int> qin;
typedef deque<ll> dqll;
typedef deque<int> dqint;
typedef priority_queue<ll> pqll;
typedef priority_queue<int> pqin;
typedef map<ll,ll> mpll;
typedef map<int,int> mpin;
typedef pair<ll,ll> pll;
typedef pair<int,int> pin;
const ll MOD=1000000007;
const long double PI=3.1415926535897932384626433832795;
ll pwr(ll b,ll p){ll res=1;while(p){if(p&1) {res*=b; p--;}else{b*=b; p>>=1;}}return res;}
ll mpwr(ll b,ll p){ll res=1;while(p){if(p&1) {res=(res*b)%MOD; p--;}else{b=(b*b)%MOD; p>>=1;}}return res;}
int msb (int n) {return 31-__builtin_clz(n);}
ll msbl (ll n) {return 63-__builtin_clzll(n);}
int lsb (int n) {return __builtin_ctz(n);}
ll lsbl (ll n) {return __builtin_ctzll(n);}
int setbit (int n) {return __builtin_popcount(n);}
ll setbitl (ll n) {return __builtin_popcountll(n);}
int main()
{
/*
freopen ("input.txt","r","stdin");
freopen ("output.txt","w","stdout");
*/
ios_base::sync_with_stdio(false) , cin.tie(NULL) , cout.tie(NULL);
vin a (3);
cin>>a[0]>>a[1]>>a[2];
cout<< (2*a[2]==a[1]+a[0] || 2*a[1]==a[0]+a[2] || 2*a[0]==a[1]+a[2]?"Yes":"No");
return 0;
}
/* What we know is a drop , but what we don't know is an ocean !*/ |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#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 <iomanip> //setprecision
#include <map> // map
#include <unordered_map> //unordered_map
#include <queue> // queue, priority_queue
#include <set> // set,multiset
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
#include <numeric> //accumulate,,,
#include <sstream>
#define endl "\n";
using namespace std;
using PLL = pair<long long,long long>;
typedef tuple<long long,long long,long long> TUP;
using P = pair<int,int>;
const long long INF = 4000000000000000001;
const int inf = 1001001001;
const long long MOD = 1000000007;
//Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M, long long mod) {
if (M == 0) return 1;
long long res = mod_pow((N * N) % mod, M / 2,mod);
//When end-of-a bit is 1, times simple N.
if (M & 1) res = (res * N) % mod;
return res %= mod;
}
long long gcd(long long a, long long b) {
if (b == 0) return a; else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b ;
}
long long get_mod(long long res){
if(res < 0) res += MOD;
return res % MOD;
}
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;cin >> N;
long long C;cin >> C;
vector<PLL> s(N);
vector<long long> cost(N);
vector<TUP> event;
long long last = 0;
for(int i = 0;i<N;i++){
long long a,b,c;cin >> a >> b >> c;
s.at(i) = make_pair(a,b);
last = max(last,b);
cost.at(i) = c;
event.push_back(make_tuple(a-1,1,i));
event.push_back(make_tuple(b,2,i));
}
sort(event.begin(),event.end());
long long now = get<0>(event.at(0));
long long ans = 0;
long long nowsum = 0;
long long ex = 0;
vector<long long> Time(N);
for(int i = 0;i<event.size();i++){
long long T = get<0>(event.at(i));
int type = get<1>(event.at(i));
int idx = get<2>(event.at(i));
if(T == last && type == 2){
//ex += cost.at(idx);
}
if(type == 1){
if(nowsum > C){
ans += C * (T - now);
//nowsum -= cost.at(idx);
}
else{
ans += nowsum * (T - now);
//nowsum -= cost.at(idx);
}
Time.at(idx) = T;
now = T;
nowsum += cost.at(idx);
}
else if(type == 2){
if(nowsum > C){
ans += C * (T - now);
nowsum -= cost.at(idx);
}
else{
ans += nowsum * (T - now);
nowsum -= cost.at(idx);
}
now = T;
}
if(T == last && type == 2){
//ex += cost.at(idx);
//cout << nowsum + ex << endl;
//ans += min(nowsum + ex , C);
//cout << T << endl;
//if(nowsum+ex >= C) cout << "u" << endl;
}
}
//for(int i = 0;i<N;i++) ex += cost.at(i);
cout << ans + min(ex , C) << endl;
//cout << 163089627821228 - 163089627569438 << endl;
} | // #undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#endif
#define ARG4(_1,_2,_3,_4,...) _4
#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)
#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)
#define forv(i,v) for (auto i = v.begin(); i != v.end(); ++i)
#define forr(i,v) for (auto i = v.end(); i != v.begin() && (--i, 1); )
#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef unsigned char uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;
const ld pi = 3.1415926535897932384626433832795l;
template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T> inline T abs (T x) {return x > T() ? x : -x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}
const ll mod = 998244353;
ll get_st(ll a, int st) {
ll res = 1;
while(st) {
if (st & 1) {
(res *= a) %= mod;
}
(a *= a) %= mod;
st >>= 1;
}
return res;
}
int main () {
//std::ios::sync_with_stdio(false);
//std::cin.tie(nullptr);
cout.setf(ios::showpoint | ios::fixed);
cout.precision(20);
#ifdef SG
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, m, k;
cin >> n >> m >> k;
if (n == 1 || m == 1) {
cout << get_st(k, n * m) << endl;
return 0;
}
ll ans = 0;
forn(i, 1, k + 1) {
(ans += (get_st(i, n) - get_st(i - 1, n) + mod) * (get_st(k - i + 1, m) % mod)) %= mod;
}
cout << ans << endl;
return 0;
} |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll,ll>;
template <class T> using vv = vector<vector<T>>;
#define _roverload(_a1,_a2,_a3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _roverload(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);--i)
#define rrep(...) _roverload(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bit(n) (1LL<<(n))
template<class T> inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void print() {cout << '\n';}
template<class T> void print(const vector<T> &v)
{bool f=false; for(const auto &e: v){if(f)cout << ' '; cout << e; f=true;} cout << '\n';}
template<class... T> void print(const T&... args)
{bool f=false; for(const auto &e: {args...}){if(f)cout << ' '; cout << e; f=true;} cout << '\n';}
const int INF = 1002003004;
const ll LINF = 1002003004005006007ll;
struct preprocess{preprocess()
{cin.tie(nullptr);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}}____;
#pragma endregion head
#pragma region library
const int MOD = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint& operator+=(const mint a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
// for prime MOD
mint inv() const {
return pow(MOD - 2);
}
mint& operator/=(const mint a) {
return (*this) *= a.inv();
}
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
bool operator==(const mint a) const {
return x == a.x;
}
bool operator!=(const mint a) const {
return x != a.x;
}
friend ostream& operator<<(ostream& os, const mint& value) {
os << value.x;
return os;
}
friend istream& operator>>(istream& is, mint& value) {
ll t;
is >> t;
value = mint(t);
return is;
}
};
#pragma endregion library
int main(){
int n, p; cin >> n >> p;
mint el = p-2;
el = el.pow(n-1);
print(el*(p-1));
} | #include <iostream>
using namespace std;
int main() {
int N,W;
cin>>N>>W;
cout<<N/W;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
#define sz(x) ((int)(x).size())
#define all(x) x.begin() , x.end()
#define mem(arr,val) memset(arr,val,sizeof(arr))
#define deb(x) cout<<#x<<"="<<x<<endl
#define debs(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define ppc __builtin_popcount
#define ppcll __builtin_popcountll
const int mod = 1000000007;
const int MAX = INT_MAX;
const int MIN = INT_MIN;
const char nl = '\n';
const long long INF = 1e18;
int octi(int n){
int x = 0 , cnt =1 ;
while(n!=0){
int rem = n%8 ;
x+= rem*cnt ;
cnt = cnt*10 ;
n = n/8 ;
}
return x ;
}
bool findseven(int n){
while(n!=0){
int rem = n%10 ;
if(rem==7) return true ;
n/=10 ;
}
return false ;
}
void solve(){
int n ; cin>>n ;
set<int> ans ;
for(int i=1;i<=n;i++){
if(findseven(i)){
ans.insert(i);
}
int octnum = octi(i) ;
if(findseven(octnum)){
ans.insert(i);
}
}
cout<<n - sz(ans) ;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.precision(10);cout << fixed;
#ifndef ONLINE_JUDGE
freopen("F:/input.txt", "r", stdin);
freopen("F:/output.txt", "w", stdout);
#endif
int T = 1;
// cin >> T;
while (T--) {
solve();
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
for(int i = 1; i <= n; i++){
bool ok = true;
for(int base : {8,10}){
int x = i;
while( x > 0){
if(x%base == 7) ok = false;
x /= base;
}
}
if(ok) ++ans;
}
cout << ans << endl;
} |
#include<bits/stdc++.h>
#define ld double long
#define ll long long
#define ull unsigned long long
#define all(A) A.begin(), A.end()
#define pb push_back
#define fri(start , end , step) for(int i = start; i < end ; i = i + step)
#define frj(start , end , step) for(int j = start; j < end ; j = j + step)
#define fast ios_base::sync_with_stdio(0); cin.tie(0)
#define debug(x) cerr<<#x<<": "<<x<<endl;
using namespace std;
void pv(vector<ll>& vec ){
fri(0 , vec.size() , 1) cout << vec[i] << " ";
cout << "\n";
}
multiset<string> A;
char ans[20][20];
string ss = "ABCDEFGH";
pair<int , multiset<string>> check(multiset<string> tec , int i1 , int j1){
int cof = 0;
fri(0 , 20 , 1){
string s;
frj(i , i + 12 , 1){
if(ans[i1][j % 20] != '0' ) s += ans[i1][j % 20];
else break;
int c = tec.count(s) ;
if(c) {
cof += c;
tec.erase(s);
}
}
}
fri(0 , 20 , 1){
string s;
frj(i , i + 12 , 1){
if(ans[j % 20][j1] != '0' ) s += ans[j % 20][j1];
else break;
int c = tec.count(s) ;
if(c) {
cof += c;
tec.erase(s);
}
}
}
return {cof , tec};
}
bool vis[20][20];
signed main(){
fast;
int n , m;
cin >> n >> m;
map<char , int > M;
fri(0 , 20 , 1){
frj(0 , 20 , 1){
ans[i][j] = '0';
}
}
fri(0 , m , 1 ){
string s;
cin >> s;
//for(char x : s) M[x] ++;
A.insert(s);
}
queue<pair<int , int>> q;
q.push({0 , 0 });
while(!q.empty()){
int i = q.front().first ;
int j = q.front().second;
//debug(i);
//debug(j);
vis[i][j] = 1;
q.pop();
multiset<string> good;
int mx = -1;
char best;
for(char x : ss){
ans[i][j] = x;
pair<int , multiset<string>> f = check(A, i , j);
int ls= mx;
mx = max(mx , f.first);
if(ls != mx) {
good= f.second;
best = x;
}
}
if(mx == 0){
//cout << i << " " << j << endl;
int mn = 1e9 ;
for(auto x : ss){
int ls = mn;
mn = min(mn , M[x]);
if(ls != mn) {
best = x;
}
}
}
//debug(M[best]);
M[best] ++;
//debug(M[best]);
ans[i][j] = best;
/*for(int i1 = 0; i1 < 20 ; i1 ++){
for(int j1 = 0; j1 < 20 ; j1 ++){
cout << ans[i1][j1];
}
cout << endl;
}
cout << endl;
cout << i << " " << j << endl;*/
A = good;
if(i < 19 && vis[i+ 1][j] == 0) {
q.push({i + 1 , j } );
vis[i + 1][j ] = 1;
}
if(j < 19 && vis[i][j+ 1] == 0) {
q.push({i , j + 1 } );
vis[i][j + 1] = 1;
}
}
fri(0 , 20 , 1){
frj(0 , 20 , 1) cout << ans[i][j] ;
cout << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
clock_t start=clock();
int main()
{
int N,M;
cin>>N>>M;
vector<string> s(M);
string answer[N][N];
for(int i=0;i<M;i++) cin>>s[i];
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
answer[i][j]=".";
}
}
int num=0;
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(answer[i][j]=="."&&s[num].size()+j<N){
for(int k=0;k<s[num].size();k++){
answer[i][j+k]=s[num][k];
}
num++;
}
}
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
cout<<answer[i][j];
}
cout<<endl;
}
}
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <complex>
#include <vector>
#include <limits>
#include <iomanip>
#include <cassert>
#include <numeric>
#include <chrono>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << #x << " = " << (x) << endl;
#define debug_pii(x) cerr << "(" << x.first << "," << x.second << ")";
#define rep(i, n) for(int i = 0;i < n;i++)
#define pb push_back
#define F first
#define S second
// template<typename _Ty1, typename _Ty2>
// ostream& operator<<(ostream& _os, const pair<_Ty1, _Ty2>& _p) {
// _os << '(' <<_p.first << ',' << _p.second << ')';
// return _os;
// }
//
// template<typename _Ty1, typename _Ty2>
// istream& operator>>(istream& _is, pair<_Ty1, _Ty2>& _p) {
// _is >> _p.first >> _p.second;
// return _is;
// }
int query(int s, int e) {
cout << "? " << s << " " << e << endl;
int in;cin >> in;
return in;
}
void solve() {
// sure, maybe
// sure > 4 -> 0
// maybeC(4-sure)*24
set<int> sure, notsure;
string s;cin>>s;
for(int i = 0;i < 10;i++) {
char ch = s[i];
if(ch == 'o') sure.insert(i);
if(ch == 'x') notsure.insert(i);
}
int ans = 0;
rep(i,10){
rep(j,10){
rep(k,10){
rep(l,10){
// i j k l
bool possible = true;
set<int> z{i,j,k,l};
for(int x : z) if(notsure.count(x) == 1) possible = false;
for(int x : sure) if(z.count(x) == 0) possible = false;
ans += possible;
}
}
}
}
cout<<ans<<endl;
}
// 5
// (300+3t) + x
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
// cout << fixed << setprecision(15);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define int long long
#define arr(a) new int[a]
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define dbV(arr) cout << #arr << "=[ "; \
for(auto i:arr) cout << i << " "; cout << "]\n";
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define repF(i,a,n) for(int i = (a); i <= (n); ++i)
#define repB(i,a,n) for(int i = (a); i >= (n); --i)
#define test(t) int t;cin>>t;while(t--)
#define inp(a) int a;cin>>a;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define umii unordered_map<int,int>
#define umll unordered_map<ll,ll>
#define mii map<int,int>
#define mll map<ll,ll>
#define seti set<int>
#define setl set<ll>
#define pb push_back
#define F first
#define S second
#define MOD 1000000007
#define all(z) z.begin(),z.end()
using namespace std;
void printArray(int a[],int n)
{
rep(i,n)
cout<<a[i]<<" ";
cout<<"\n";
}
void printVec(vi v)
{
int s = v.size();
rep(i,s)
cout<<v[i]<<" ";
cout<<"\n";
}
void printBool(bool b)
{
if(b) cout<<"YES\n";
else cout<<"NO\n";
}
bool check(int a,string s)
{
int p = a/1000,q = a/100 - 10*p,r = a/10 - 100*p - 10*q,t = a - 1000*p - 100*q - 10*r;
bool b = 1;
for(int i = 0;i<10;i++)
{
if(s[i] == 'o')
{
if(p != i && q != i && r != i && t != i)
{
b = 0;
break;
}
}
else if(s[i] == 'x')
{
if(p == i || q == i || r == i || t == i)
{
b = 0;
break;
}
}
}
return b;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s;
cin>>s;
int ans = 0;
for(int i = 0;i<10000;i++)
{
if(check(i,s))
ans++;
}
cout<<ans;
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, M;
cin >> N >> M;
V<ll> X(M), Y(M);
REP(i, M) cin >> X[i] >> Y[i];
set<ll> st;
st.insert(N);
V<ll> ids(M, 0);
iota(ALL(ids), 0);
sort(ALL(ids), [&](ll x, ll y){
return X[x] < X[y];
});
REP(i, M){
ll j = i;
while(j < M and X[ids[i]] == X[ids[j]]){
j++;
}
ll len = j - i;
V<ll> check(len, 0);
V<ll> vals;
for(ll k=i;k<j;k++){
vals.push_back(Y[ids[k]]);
}
REP(k, len){
if(st.find(vals[k]-1) != st.end() or st.find(vals[k]+1) != st.end()){
check[k] = 1;
}
}
REP(k, len){
if(check[k]){
st.insert(vals[k]);
}else{
auto itr = st.find(vals[k]);
if(itr != st.end()) st.erase(itr);
}
}
i = j - 1;
// for(auto x: st) cerr << x << " ";
// cerr << endl;
}
cout << st.size() << endl;
return 0;
} | // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y second
#define gcd(a,b) __gcd(a,b)
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define hell 1000000007
#define elasped_time 1.0 * clock() / CLOCKS_PER_SEC
template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.x>>a.y;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.x<<" "<<a.y;return out;}
template<typename T,typename T1>T maxs(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T mins(T &a,T1 b){if(b<a)a=b;return a;}
int solve(){
int n,m; cin >> n >> m;
map<int,vector<int>>col;
set<pii>st;
map<int,set<int>>mp;
mp[n].insert(0);
col[n].push_back(0);
for(int i = 1; i <= m; i++){
int x,y; cin >> x >> y;
st.insert({x,y});
col[y].push_back({x});
mp[y].insert(x);
}
for(auto &i:col){
sort(all(i.y));
}
set<pii>reached;
set<int>ans;
reached.insert({0,n});
for(auto [x,y]:reached){
if(st.count({x+1,y-1})){
reached.insert({x+1,y-1});
st.erase({x+1,y-1});
mp[y-1].erase({x+1});
}
if(st.count({x+1,y+1})){
reached.insert({x+1,y+1});
st.erase({x+1,y+1});
mp[y+1].erase(x+1);
}
int j = upper_bound(all(col[y]),x) - col[y].begin();
int row;
if(col[y].back() == x) row = 2*n;
else row = col[y][j];
vector<pii>remove;
auto itr = mp[y+1].upper_bound(x);
while(itr != mp[y+1].end() and *itr <= row){
reached.insert({*itr,y+1});
remove.push_back({*itr,y+1});
itr++;
}
itr = mp[y-1].upper_bound(x);
while(itr != mp[y-1].end() and *itr <= row){
reached.insert({*itr,y-1});
remove.push_back({*itr,y-1});
itr++;
}
for(auto [i,j]:remove){
st.erase({i,j});
mp[j].erase(i);
}
if(col[y].back() == x)ans.insert(y);
}
cout << ans.size() << endl;
return 0;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#ifdef SIEVE
sieve();
#endif
#ifdef NCR
init();
#endif
int t=1;//cin>>t;
while(t--){
solve();
}
return 0;
}
|
//#define _DEBUG
#include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef _DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(index,num) for(int index=0;index<(int)num;index++)
#define rep1(index,num) for(int index=1;index<=(int)num;index++)
#define brep(index,num) for(int index=(int)num-1;index>=0;index--)
#define brep1(index,num) for(int index=(int)num;index>0;index--)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define puba(a) emplace_back((a))
typedef long long ll;
typedef long double ld;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
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; }
ll INFl=(ll)1e+18+1;
int INF=1e+9+1;
char a[2004][2004];
char moto[2004][2004];
int dismin[2004][2004];
int dp[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int main(){
int H,W;
scan(H>>W);
rep1(i,H){
scan(a[i]+1);
}
rep(i,H+2) a[i][0]=a[i][W+1]='#';
rep(j,W+2) a[0][j]=a[H+1][j]='#';
rep(i,H+2) rep(j,W+2) moto[i][j]=a[i][j];
fill(dismin[0],dismin[2004],INF);
vpint warp[26];
pint st,go;
rep(i,H+2){
rep(j,W+2){
if(a[i][j]!='#'){
if(a[i][j]=='S'){
st=mp(i,j);
}
if(a[i][j]=='G'){
go=mp(i,j);
}
else if('a'<=a[i][j]&&a[i][j]<='z'){
warp[a[i][j]-'a'].puba(mp(i,j));
}
a[i][j]='.';
}
}
}
pint inizahyo;
inizahyo=st;
dismin[st.first][st.second]=0;
vector<pint> zahyorecord;
zahyorecord.push_back(inizahyo);
bool alre[26]={};
for(int count=1;;count++){
if(zahyorecord.empty()) break;
vector<pint> zahyobefore=move(zahyorecord);
zahyorecord.clear();
rep(i,zahyobefore.size()){
rep(j,4){
pint zahyoto=zahyobefore[i];
int y=zahyoto.first+dp[j][1];
int x=zahyoto.second+dp[j][0];
if(a[y][x]=='.'&&count<dismin[y][x]){
zahyorecord.puba(mp(y,x));
dismin[y][x]=count;
}
}
pint zahyoto=zahyobefore[i];
int y=zahyoto.first,x=zahyoto.second;
debug(count,y,x);
if('a'<=moto[y][x]&&moto[y][x]<='z'&&alre[moto[y][x]-'a']==0){
for(const auto& v:warp[moto[y][x]-'a']){
if(v==zahyoto) continue;
int yto=v.first,xto=v.second;
if(count<dismin[yto][xto]){
zahyorecord.puba(mp(yto,xto));
dismin[yto][xto]=count;
}
}
alre[moto[y][x]-'a']=1;
}
}
}
if(dismin[go.first][go.second]>=INF) prin(-1);
else prin(dismin[go.first][go.second]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
using ll = long long;
int A[100100], B[100100], C[100100];
vector<bool> seen(100100, false);
vector<int> ans = {1}, pass(100100,0);
void dfs(int s, vector<vector<int>> &G){
seen.at(s) = true;
pass.at(C[s])++;
for(auto next: G.at(s)){
if(seen.at(next)) continue;
if(pass.at(C[next]) == 0) ans.push_back(next);
dfs(next,G);
}
pass.at(C[s])--;
return;
}
int main(){
int N;
cin >> N;
rep(i,1,N+1) cin >> C[i];
rep(i,1,N) cin >> A[i] >> B[i];
vector<vector<int>> graph(100100);
rep(i,1,N){
graph.at(A[i]).push_back(B[i]);
graph.at(B[i]).push_back(A[i]);
}
dfs(1, graph);
sort(ans.begin(), ans.end());
for(auto x: ans) cout << x << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> answers(n+1,1);
for(int i=2;i<=n;i++){
set<int> divisors;
for(int j=1;j<=sqrt(i);j++){
if(i%j==0){
divisors.insert(answers[j]);
divisors.insert(answers[i/j]);
}
}
int index=1;
while(true){
if(divisors.count(index)==0){
break;
}
index++;
}
answers[i]=index;
}
for(int i=1;i<=n;i++){
cout<<answers[i]<<" ";
}
return 0;
} | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define MAX 510000
#define rrep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep(i, n) for(ll i = 1; i <= (ll)(n); i++)
#define dcout cout<<fixed<<setprecision(15);
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
constexpr int MOD = 998244353;
constexpr ll inf = 1LL << 60;
template< typename S, typename T >
inline void chmax(S &a, const T &b) { if(a < b) a = b; }
template< typename S, typename T >
inline void chmin(S &a, const T &b) { if(a > b) a = b; }
//lcm//
ll gcd(ll x, ll y) {
if (x == 0) return y;
return gcd(y%x, x);
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
//a^n mod p//
ll modpow(ll a, ll n, ll p) {
if(n==0) return (ll)1;
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modpow(a, n - 1, p)) % p;
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
//inversemod//
ll modinv(ll a, ll m) {
if(m==0)return (ll)1;
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
//Cmonp//
ll fac[MAX], finv[MAX], inv[MAX];
//
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
//
ll COM(ll n, ll k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//LARGE n
ll com(ll n,ll m){
if(n<m || n<=0 ||m<0){
return 0;
}
if( m==0 || n==m){
return 1;
}
ll k=1;
for(ll i=1;i<=m;i++){
k*=(n-i+1);
k%=MOD;
k*=modinv(i,MOD);
k%=MOD;
}
return k;
}
//radP
ll rad(ll u, ll p){
ll cnt=0;
while(u%p==0){
u/=p;
cnt++;
}
return cnt;
}
////////////////////////////////////////////////////////////////////
ll d(ll n){
for(ll i=1;i<=15;i++){
if(n<=9){return i;
break;}
else n/=10;
}
}
ll ks(ll n){
ll val=1;
for(int k=1;k<=100;k++){
ll fin=0;
if(n==1){return val;}
for(int i=2;i<=n;i++){
if(n%i==0){n/=i;
val++;
break;}
if((i+1)*(i+1)>n){return val+1;}
}
if(fin==1 || n==1){return val;}
}
}
int main() {
ios::sync_with_stdio(false);
ll n;
cin>>n;
if(n==1){
cout<<1<<endl;
return 0;}
cout<<1<<" ";
for(ll i=2;i<=n-1;i++){
cout<<ks(i)<<" ";
}
cout<<ks(n)<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pii;
typedef pair<long long, int> pli;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) (x).size()
ll mod = 998244353;
ll gcd(ll a, ll b){
if (a%b == 0)return(b);
else return(gcd(b, a%b));
}
ll inv(ll x){
ll res = 1;
ll k = mod - 2;
ll y = x;
while(k){
if(k&1)res = (res*y)%mod;
y = (y*y) % mod;
k /= 2;
}
return res;
}
struct LazySegmentTree {
private:
int n;
vector<ll> node, lazy;
public:
LazySegmentTree(vector<ll> v) {
int sz = (int)v.size();
n = 1; while(n < sz) n *= 2;
node.resize(2*n-1);
lazy.resize(2*n-1, 0);
for(int i=0; i<sz; i++) node[i+n-1] = v[i];
for(int i=n-2; i>=0; i--) node[i] = node[i*2+1] + node[i*2+2];
}
// k 番目のノードについて遅延評価を行う
void eval(int k, int l, int r) {
// 遅延配列が空でない場合、自ノード及び子ノードへの
// 値の伝播が起こる
if(lazy[k] != 0) {
node[k] = (node[k] + lazy[k]) % mod;
// 最下段かどうかのチェックをしよう
// 子ノードは親ノードの 1/2 の範囲であるため、
// 伝播させるときは半分にする
if(r - l > 1) {
lazy[2*k+1] = (lazy[2*k+1] + lazy[k]) % mod * inv(2) % mod;
lazy[2*k+2] = (lazy[2*k+2] + lazy[k]) % mod * inv(2) % mod;
}
// 伝播が終わったので、自ノードの遅延配列を空にする
lazy[k] = 0;
}
}
void add(int a, int b, ll x, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
// k 番目のノードに対して遅延評価を行う
eval(k, l, r);
// 範囲外なら何もしない
if(b <= l || r <= a) return;
// 完全に被覆しているならば、遅延配列に値を入れた後に評価
if(a <= l && r <= b) {
lazy[k] = (lazy[k] + (r - l) * x % mod) % mod;
eval(k, l, r);
}
// そうでないならば、子ノードの値を再帰的に計算して、
// 計算済みの値をもらってくる
else {
add(a, b, x, 2*k+1, l, (l+r)/2);
add(a, b, x, 2*k+2, (l+r)/2, r);
node[k] = (node[2*k+1] + node[2*k+2]) % mod;
}
}
ll getsum(int a, int b, int k=0, int l=0, int r=-1) {
if(r < 0) r = n;
if(b <= l || r <= a) return 0;
// 関数が呼び出されたら評価！
eval(k, l, r);
if(a <= l && r <= b) return node[k];
ll vl = getsum(a, b, 2*k+1, l, (l+r)/2);
ll vr = getsum(a, b, 2*k+2, (l+r)/2, r);
return (vl + vr)%mod;
}
};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
char s,t;
cin >> s >> t;
if(s == 'Y') t = 'A' + (t - 'a');
cout << t << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define intt long long int
#define intu unsigned long long int
#define vi vector<intt>
#define ii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define fast_io ios::sync_with_stdio(0);cin.tie(NULL);std::cout.tie(NULL);
# define PI 3.14159265358979323846
#define all(a) a.begin(),a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define bloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
int mod = 1000000007;
intt gcd(intt a, intt b) {return b ? gcd(b, a % b) : a;}
int lcm(int a, int b) {return a * b / gcd(a, b); }
intt bpow(intt a,intt b)
{
intt res = 1;
while (b > 0) {
if (b & 1)res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
intt fact(intt n) {
if ((n==0)||(n==1))
return 1;
else
return (n*fact(n-1))%mod;
}
void go()
{
#ifndef ONLINE_JUDGE
freopen("IN.txt","r",stdin);
freopen("OUT.txt","w",stdout);
#endif
}
bool isPowerOfTwo (int x)
{
return (!(x&(x-1)));
}
int main(){
go();
fast_io
char a,b;cin>>a>>b;
if(a=='Y')
cout << (char)(b-32) << "\n";
else
cout << b <<"\n";
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i = 0;(i) < ((int)(n));++(i))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define test(a) cout<<"line:"<<__LINE__<<"["<<(#a)<<": "<<(a)<<"]"<<endl
constexpr int INF = 1e9+7;
constexpr ll INFL = 9*1e18;
constexpr int dx[4] = { 1, 0, -1, 0 };
constexpr int dy[4] = { 0, 1, 0, -1 };
// constexpr int dx[8] = {1, 1, 0,-1,-1,-1, 0, 1};
// constexpr int dy[8] = {0, 1, 1, 1, 0,-1,-1,-1};
int inline digit(ll num){int tmp = 0;while(num){tmp++;num/=10;}return tmp;} // 桁数
ull inline power(ull a,ull b){ull res = 1;rep(i,b)res *= a;return res;}
template<typename T>inline T SUM(vector<T> vec){return accumulate(all(vec),(T)0);} // vectorの中身を全部足す
template<typename T>inline T digitSum(T num){T sum = 0;while(num){sum+=num%10;num/=10;}return sum;} // 各桁の和
template<typename T>inline T gcd(T a,T b){if(b == 0)return a;return gcd(b,a%b);} // 最大公約数
template<typename T>inline T lcm(T a, T b){T g = gcd(a,b);return a/g*b;} // 最小公倍数
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<typename T>inline void print(T&& x){cout<<setprecision(32)<<x<<endl;}
string to_oct(int n){string s;while(n){s = to_string(n%8) + s;n /= 8;}return s;}
int main(){
int n,m,q;cin>>n>>m>>q;
vector<pair<int,int>> vw(n);rep(i,n)cin>>vw[i].se>>vw[i].fi;
vector<int> x(m);rep(i,m)cin>>x[i];
vector<int> a;
sort(all(vw),greater<pair<int,int>>());
rep(_,q){
int l,r;cin>>l>>r;l--;r--;
vector<int> boxes;
rep(i,m){
if(l <= i && i <= r)continue;
boxes.push_back(x[i]);
}
sort(all(boxes));
int ans = 0;
rep(i,n){
for(auto&& box: boxes){
if(vw[i].second <= box){
ans += vw[i].first;
box = -1;
break;
}
}
}
a.push_back(ans);
}
for(auto&& one: a){
print(one);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define fast() ios :: sync_with_stdio(false); cin.tie(0);
#define ll long long int
#define ull unsigned long long int
#define vl vector<long long>
#define vc vector<char>
#define vs vector<string>
#define vp vector< pair<ll,ll> >
#define sl set<long long>
#define sc set<char>
#define sts stack<string>
#define max_3(a,b,c) max(a, max(b,c))
#define max_4(a,b,c,d) max(a,max(b,max(c,d)))
#define min_3(a,b,c) min(a, min(b,c))
#define min_4(a,b,c,d) min(a,min(b,min(c,d)))
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define pi 2*acos(0.0)
#define N 200006
#define mnn 10000000000000
#define mxx -10000000000000
#define in 1234567890;
ll a[N],b[N];
int M=1000000007;
map<ll,ll>mp,mk;
sl s1,s2;
vl v;
vl w,w1,w2,w3;
ll m,n,c,d,i,j,k,l,r,x,t,y,u,e,f,g,mn,mx,z;
string s,q,p;
char ch,ck;
int main()
{
fast()
t==1;
cin>>s>>p;
for(i=0;i<s.size();i++) c+=s[i]-'0';
for(i=0;i<p.size();i++) d+=p[i]-'0';
cout<<max(c,d);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2 * 1e5 + 10;
long long a[N],b[N];
int n,w;
void insert(int l , int r , int c){
b[l] += c;
b[r] -=c;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("water_heater.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> n >> w;
int maxt = -1;
for(int i = 1; i <= n; i++){
int s,t,k; cin >> s >> t >> k;
maxt = max(maxt,t+1);
insert(s+1,t+1,k);
}
for(int i = 1; i <= maxt + 10; i++) a[i] = a[i-1] + b[i];
// for(int i = 1; i <= maxt + 10; i++) {
// cout << a[i] << " ";
// }
// cout << endl;
for(int i = 1; i <= maxt + 10; i++) {
if(a[i] > w) {
cout << "No";
return 0;
}
}
cout << "Yes";
// cout << endl;
return 0;
}
/*
struct node{
int l,r,w;
};
bool cmp(node &a,node &b){
if(a.l != b.l){
return a.l < b.l;
}else{
return a.r < b.r;
}
}
const int N = 2 * 1e5 + 10;
typedef pair<int,int> PII;
int n,k;
node a[N];
int main(){
#ifndef ONLINE_JUDGE
freopen("water_heater.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> n >> k;
for(int i = 0; i < n ; i++){
cin >> a[i].l >> a[i].r >> a[i].w;
}
sort(a,a+n,cmp);
// for(int i = 0 ; i < n ; i++){
// cout << a[i].l <<";" << a[i].r <<endl;
// }
// cout << "-----------------" << endl;
int sum_t = a[0].w , tail = a[0].r , curr = 0;
for(int i = 1 ; i < n; i++){
while(curr < i && tail <= a[i].l){
sum_t -= a[curr++].w;
tail = a[curr].r;
// cout << "curr"<<curr << endl;
// cout <<"tail:"<< a[curr].r <<endl;
}
if(i == curr) {
sum_t = a[i].w;
}
if(tail > a[i].l){
sum_t += a[i].w;
// cout <<"sum_t:"<< sum_t << endl;
if(sum_t > k){
cout << "No" << endl;
return 0;
}
}
// cout << sum_t <<endl;
}
cout <<"Yes" << endl;
return 0;
}
*/ | #pragma GCC optimize("Ofast")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <functional>
#include <array>
#include <chrono>
#include <random>
#include <vector>
#include <string>
#include <sstream>
#include <cmath>
#include <cstring>
#include <bitset>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cassert>
#define sq(x) ((x) * (x))
#define err(x) cerr << "["#x"] " << (x) << "\n";
#define errp(x) cerr << "["#x"] {" << ((x).first) << ", " << ((x).second) << "}\n";
#define errv(x) {cerr << "["#x"] [";for(const auto& ___ : (x)) cerr << ___ << ", "; cerr << "]\n";}
#define errvn(x, n) {cerr << "["#x"] [";for(auto ___ = 0; ___ < (n); ++___) cerr << (x)[___] << ", "; cerr << "]\n";}
#define errf() cerr << "\n\n";
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll getrnd(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
template <typename T1, typename T2> inline bool relax(T1& a, const T2& b) {
return a > b ? a = b, true : false;
}
template <typename T1, typename T2> inline bool strain(T1& a, const T2& b) {
return a < b ? a = b, true : false;
}
// :::::::::::::::::::::::::::::::
const int N = 2e5 + 3, A = N * 2 + 3;
struct fenwick {
int n;
vector<ll> tr;
fenwick(int n) : n(n), tr(n) {}
void upd(int r, int x) {
for (; r < n; r |= r + 1)
tr[r] += x;
}
ll get(int r) {
ll res = 0;
for (; r >= 0; r &= r + 1, --r)
res += tr[r];
return res;
}
ll get(int l, int r) {
return get(r) - get(l - 1);
}
};
void solve() {
int n, m, q;
cin >> n >> m >> q;
vector<int> ids = {0};
vector<tuple<int, int, int>> qs;
for (int i = 0; i < q; ++i) {
int t, x, y;
cin >> t >> x >> y;
ids.emplace_back(y);
qs.emplace_back(t, x - 1, y);
}
sort(ids.begin(), ids.end());
ids.resize(unique(ids.begin(), ids.end()) - ids.begin());
auto gid = [&](int x) {
return lower_bound(ids.begin(), ids.end(), x) - ids.begin();
};
ll ans = 0;
fenwick sa(A), sb(A), ca(A), cb(A);
vector<int> a(n), b(m);
for (int i = 0; i < n; ++i)
ca.upd(0, 1);
for (int i = 0; i < m; ++i)
cb.upd(0, 1);
for (auto [type, i, val] : qs) {
if (type == 1) {
int id = gid(a[i]);
sa.upd(id, -a[i]);
ca.upd(id, -1);
int bef = cb.get(id);
ans -= 1LL * bef * a[i];
ans -= sb.get(id + 1, A - 1);
a[i] = val;
id = gid(a[i]);
sa.upd(id, a[i]);
ca.upd(id, 1);
int blw = cb.get(id);
ans += 1LL * blw * a[i];
ans += sb.get(id + 1, A - 1);
}
else {
int id = gid(b[i]);
sb.upd(id, -b[i]);
cb.upd(id, -1);
int bef = ca.get(id);
ans -= 1LL * bef * b[i];
ans -= sa.get(id + 1, A - 1);
b[i] = val;
id = gid(b[i]);
sb.upd(id, b[i]);
cb.upd(id, 1);
int blw = ca.get(id);
ans += 1LL * blw * b[i];
ans += sa.get(id + 1, A - 1);
}
cout << ans << '\n';
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//O(V+E)
vector <ll> v[10000];
void bfs(ll source,ll vis[])
{
ll i,child;
queue<ll>q;
q.push(source);
vis[source] = 1;
while(!q.empty())
{
ll parent = q.front();
q.pop();
for(i=0;i<v[parent].size();i++)
{
child = v[parent][i];
if(vis[child] == 0)
q.push(child);
vis[child] = 1;
}
}
}
int main()
{
ll i,n,m,x,y,ans=0,j;
cin>>n>>m;
for(i=0;i<m;i++)
{
cin>>x>>y;
v[x].push_back(y);
}
for(long long i=1;i<=n;i++)
{
ll vis[n+9];
memset(vis,0,sizeof(vis));
bfs(i,vis);
for(j=1;j<=n;j++)
if(vis[j])
ans++;
}
cout<<ans<<'\n';
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
#define vi vector<int>
#define vvi(_Name,_Height,_Width) vector<vi>_Name(_Height,vi(_Width))
#define vvi_v(_Name,_Height,_Width,_Value) vector<vi>_Name(_Height,vi(_Width,_Value))
#define pii pair<int,int>
using namespace std;
void fail(string s){ cout<<s;exit(0); }
void fail(int s){ cout<<s;exit(0); }
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
vi v[2000];
vi use(2000);
int n,m;
int dfs(int u){
use[u]=1;
int ans=1;
for(int i:v[u]){
if(!use[i])
ans+=dfs(i);
}
re ans;
}
void run_test_case(){
cin>>n>>m;
rep(i,m){
int a,b;
cin>>a>>b;
v[a-1].pb(b-1);
}
int ans=0;
rep(i,n){
rep(_,n)use[_]=0;
ans+=dfs(i);
}
cout<<ans<<'\n';
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int test_cases=1;
// cin>>test_cases;
while(test_cases--)
run_test_case();
re 0;
}
|
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <complex>
#include <vector>
#include <limits>
#include <iomanip>
#include <cassert>
#include <numeric>
#include <chrono>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define debug(x) cerr << #x << " = " << (x) << endl;
#define debug_pii(x) cerr << "(" << x.first << "," << x.second << ")";
#define rep(i, n) for(int i = 0;i < n;i++)
#define pb push_back
#define F first
#define S second
// template<typename _Ty1, typename _Ty2>
// ostream& operator<<(ostream& _os, const pair<_Ty1, _Ty2>& _p) {
// _os << '(' <<_p.first << ',' << _p.second << ')';
// return _os;
// }
//
// template<typename _Ty1, typename _Ty2>
// istream& operator>>(istream& _is, pair<_Ty1, _Ty2>& _p) {
// _is >> _p.first >> _p.second;
// return _is;
// }
const int nmax = 1000;
bool g[nmax][nmax][26];
int n,m,a,b;char c;
bool visited[nmax][nmax];
int dist[nmax][nmax];
vector<pii> gg[nmax];
int bfs(int s,int e) {
queue<pii> q;
q.push({s,e});
visited[s][e] = true;
int ans = INT_MAX;
while (!q.empty()) {
pii v = q.front();
q.pop();
if(v.F == v.S) {
ans=min(ans, dist[v.F][v.S]);
continue;
}
bool chk = false;
rep(i,26) {
if(g[v.F][v.S][i]) {
ans=min(ans, dist[v.F][v.S]+1);
chk=true;
break;
}
}
if(chk) continue;
s = v.F,e = v.S;
for(int i = 0;i < gg[s].size();i++) {
for(int j = 0;j < gg[e].size();j++) {
if(gg[s][i].S != gg[e][j].S) continue;
if(gg[s][i].F == s && gg[e][j].F == e) continue;
if(!visited[gg[s][i].F][gg[e][j].F]) {
visited[gg[s][i].F][gg[e][j].F]=true;
q.push({gg[s][i].F,gg[e][j].F});
dist[gg[s][i].F][gg[e][j].F]=dist[s][e]+2;
}
}
}
}
return (ans == INT_MAX?-1:ans);
}
void solve() {
cin>>n>>m;
rep(i,m){
cin>>a>>b>>c;
a--;b--;
g[a][b][c-'a']=g[b][a][c-'a']=1;
gg[a].pb({b,c-'a'});
gg[b].pb({a,c-'a'});
}
cout << bfs(0, n-1) << endl;
}
// 2 10 5 15 30
// ABABABA A
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
// cout << fixed << setprecision(15);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
}
| #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
vector<int> v[1000][26];
int n,m,a,b,c,d[1000][1000];
char cha;
string s;
queue<int> que;
int main(void){
cin>>n>>m;
for(int i=0;i<n;i++){
que.push(i*1000+i);
for(int j=0;j<n;j++){
if(i!=j)d[i][j]=(1<<30);
}
}
for(int i=0;i<m;i++){
cin>>a>>b>>cha;
a--,b--;
v[a][cha-'a'].push_back(b);
if(a!=b)v[b][cha-'a'].push_back(a);
if(a!=b){
d[a][b]=1;
d[b][a]=1;
que.push(1000*a+b);
}
}
while(que.size()){
a=que.front()/1000;
b=que.front()%1000;
que.pop();
if(abs(b-a)==n-1){
cout<<d[a][b]<<endl;
return 0;
}
for(int i=0;i<26;i++){
for(auto x:v[a][i]){
for(auto y:v[b][i]){
if(d[x][y]>d[a][b]+2){
d[x][y]=d[a][b]+2;
que.push(x*1000+y);
}
}
}
}
}
cout<<-1<<endl;
}
|
/*input
3 2
*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define eb emplace_back
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (int)(lower_bound(c.begin(),c.end(),x)-c.begin())
#define EL cout<<'\n'
#define BS(a,x) binary_search(ALL(a),x)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
out<<'('<<P.F<<','<<P.S<<')';
return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
REP(i,SZ(V)) out<<V[i]<<((i!=SZ(V)-1)?" ":"");
return out;
}
//}}}
const ll maxn=300005;
const ll maxlg=20;
const ll INF64=1e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;
ll mypow(ll a,ll b){
ll res=1LL;
while(b){
if(b&1) res=res*a%MOD;
a=a*a%MOD;
b>>=1;
}
return res;
}
int main(){
IOS;
ll ans = 1;
for(ll i=2;i<=30;i++){
ans = ans * i / __gcd(ans,i);
}
cout<<ans+1<<'\n';
return 0;
}
| // TestCpp.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
#include <string>
using namespace std;
int main() {
string x;
cin >> x;
//cin >> c >> d;
auto pos = x.find(".");
auto res = x.substr(0, pos);
cout << res << endl;
} |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int N,W,x;
cin>>N>>W;
x=N/W;
cout<<x;
} | #include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define INF 9999999999999999
#define rep(i,m,n) for(int i = m; i < n ;i++)
#define rrep(i,m,n) for(int i = m - 1; i >= n ;i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(),N.end()),N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(),n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K,L,N,S) vector<L> K(N,S)
#define DV(K,L,N,M,S) vector<vector<L>> K(N,vector<L>(M,S))
#define TV(K,L,N,M,R,S) vector<vector<vector<L>>> K(N,vector<vector<L>>(M,vector<L>(R,S)))
#define pint pair<ll,ll>
#define tint tuple<ll, ll, ll>
#define mod 998244353
#define MAX 10000010
#define ALL(a) a.begin(),a.end()
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll N, W;
cin >> N >> W;
cout << N / W << endl;
} |
#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; for(int tt = 0; tt < t; ++tt)
#define sz(x) (int)(x).size()
#define sort_unique(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()));
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/**
order_of_key(k) : nums strictly smaller than k
find_by_order(k): index from 0
**/
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for(auto &it : v) is >> it; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep = ""; for(const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << " end.\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
const int N = 3e3 + 5;
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;
/**
Read problem statement carefully
**/
LL dp[N][N]; // dp[i][j], number of ways i, into j pieces
LL arr[N];
LL mp[N];
void solve(int T){
int n;
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> arr[i];
}
dp[0][0] = 1;
// dp[i][j]: use i elements, use j blocks
for(int k = 1; k <= n; ++k){ // block cnt
memset(mp, 0, sizeof mp);
LL s = 0;
for(int i = 0; i <= n; ++i){ // element cnt
s += arr[i];
s %= k;
dp[i][k] = mp[s];
mp[s] = (mp[s] + dp[i][k-1]) % mod;
}
}
LL res = 0;
for(int k = 1; k <= n; ++k){
res = (res + dp[n][k]) % mod;
}
cout << res << "\n";
}
int main()
{
Fast;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// louisfghbvc
solve(1);
return 0;
}
/**
Enjoy the problem.
**/ | #include<bits/stdc++.h>
#define w(x) int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl;
#define trace1(x,y) cerr<<#x<<": "<<x<<" "<<endl;cerr<<#y<<": "<<y<<" "<<endl;
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define endl "\n"
#define mod 1000000007
#define inp(x) cin>>x;
#define f first
#define s second
#define inf 1e18
using namespace std;
void solve(int tc) {
int n; cin >> n;
long double a = 0, b = 0, c = -inf;
// int a[n];
long double ele;
for (int i = 0; i < n; i++) {
// cin >> a[i];
cin >> ele;
ele = abs(ele);
a += abs(ele);
b += abs(ele) * abs(ele);
c = max(c, ele);
}
b = sqrt(b);
cout << fixed << setprecision(20) << a << endl << b << endl << c << endl;
}
int32_t main() {
FIO
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
// w(x) {
solve(1);
// }
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N,L;
cin >> N >> L;
vector<long long> A(N+2),B(N+2);
for (int i=0; i<N; i++) {
cin >> A[i+1];
}
for (int i=0; i<N; i++) {
cin >> B[i+1];
}
A[0] = 0;
B[0] = 0;
A[N+1] = L+1;
B[N+1] = L+1;
long long ans = 0;
long long NG,OK,md;
for (int i=1; i<N+1; i++) {
if (B[i] == A[i]) {
continue;
}
if (A[i] < B[i] && A[i+1] > B[i+1]) {
cout << -1 << endl;
return 0;
}
if ((A[i] < B[i] && B[i] == B[i+1]-1 ) || (A[i] > B[i] && B[i] == B[i-1]+1 )) {
ans++;
continue;
}
if (B[i] > A[i]) {
NG = i;
OK = N+1;
md = (NG+OK) / 2;
while (OK - NG > 1) {
md = (NG+OK) / 2;
if (A[md] >= B[i] + (md-i)) {
OK = md;
}
else {
NG = md;
}
}
if (A[OK] != B[i] + (OK-i)) {
cout << -1 << endl;
return 0;
}
else {
ans += (OK-i);
}
}
else {
NG = i;
OK = 0;
md = (NG+OK) / 2;
while (NG - OK > 1) {
md = (NG+OK) / 2;
if (A[md] <= B[i] + (md-i)) {
OK = md;
}
else {
NG = md;
}
}
if (A[OK] != B[i] + (OK-i)) {
cout << -1 << endl;
return 0;
}
else {
ans += (i-OK);
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int n, x;
int v, p;
cin >> n >> x;
int cnt = 0;
int sum = 0;
bool flag = true;
rep(i, n){
cin >> v >> p;
sum += v*p;
if(sum > 100*x && flag){
cnt = i+1;
flag = false;
}
}
if(flag) cout << -1 << endl;
else cout << cnt << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define DEBUG
typedef long long int ll;
typedef long double ld;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define MOD (ll)(1e9 + 7)
#define vi vector<int>
#define vii vector<vector<int> >
#define vl vector<ll>
#define vll vector<vector<ll> >
#define vc(T, nm) vector<T> nm
#define pb push_back
#define popb pop_back
#define si set<int>
#define sl set<ll>
#define F first
#define S second
#define pii pair<int, int>
#define mp make_pair
#define ins insert
#define ers erase
#define endl "\n"
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define adr(a, b) ((a % MOD) + (b % MOD)) % MOD
#define FORA(x, s, e, inc) for(ll x = s; x != e; x += inc)
#define ROFA(x, s, e, inc) for(ll x = s; x != e; x -= inc)
#define FOR(x, s, e) FORA(x, s, e, 1)
#define ROF(x, s, e) ROFA(x, s, e, 1)
#define loop(x, n) FOR(x, 0, n)
#define rd1(t, a) t a; cin >> a;
#define rd2(t, a, b) rd1(t, a); rd1(t, b);
#define rd3(t, a, b, c) rd2(t, a, b); rd1(t, c);
#define rd4(t, a, b, c, d) rd3(t, a, b, c); rd1(t, d);
#define rd5(t, a, b, c, d, e) rd4(t, a, b, c, d); rd1(t, e);
#define rd6(t, a, b, c, d, e, f) rd5(t, a, b, c, d, e); rd1(t, f);
#define rdA(t, nm, len) t nm[len]; loop(i, len) {cin >> nm[i];}
#ifdef DEBUG
#define deb(v) cout << endl << #v << ": " << v << endl
#define db1(v) cout << endl << #v << ": " << "[ "; for(auto x: v) {cout << x << " ";}; cout << "]" << endl;
#define db2(v) cout << endl << #v << ": " << endl; for(auto r: v) {cout << "[ "; for(auto x: r) {cout << x << " ";}; cout << "]" << endl;};
#define dbl cout << "-------------------------------" << endl
#else
#define deb(v)
#define db1(v)
#define db2(v)
#define dbl
#endif
void solve() {
rd2(ll, n, q);
vl A(n);
for(ll i = 0 ; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vl Q(q);
for(int i = 0; i < q; i++) {
cin >> Q[i];
}
vl B = Q;
sort(B.begin(), B.end());
map<ll, ll> ans;
ll prev_point = 0;
ll allc_count = 0;
ll q_ct = 0;
ll prev_gap = 0;
for(ll i = 0; i < n; i++) {
if(q_ct == Q.size())
break;
ll num = A[i];
ll gap = num - prev_point - 1;
allc_count += gap;
while(q_ct < Q.size() and allc_count >= B[q_ct]) {
ll pick = prev_point + B[q_ct] - prev_gap;
ans[B[q_ct]] = pick;
q_ct++;
}
prev_point = num;
prev_gap = allc_count;
}
while(q_ct < Q.size()) {
ll pick = prev_point + B[q_ct] - allc_count;
ans[B[q_ct]] = pick;
q_ct++;
}
vl ret;
for(auto x: Q) {
cout << ans[x] << endl;
}
}
int main() {
fastio;
ll t = 1;
// rd1(ll, t);
while(t--) {
solve();
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<long long> A(N);
for (auto& x : A) {
cin >> x;
}
vector<long long> low(N);
for (int i = 0; i < N; ++i) {
low[i] = A[i] - (i + 1);
}
while (Q--) {
long long K;
cin >> K;
const int idx = lower_bound(low.begin(), low.end(), K) - low.begin();
if (idx == N) {
cout << A[N - 1] + (K - low[N - 1]) << '\n';
} else {
cout << A[idx] - (low[idx] - K + 1) << '\n';
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define fl(n) for(int i=0;i<n;i++)
#define flj(n) for(int j=0;j<n;j++)
#define flo(n) for(int i=1;i<=n;i++)
#define mii map<int,int>
#define mci map<char,int>
#define V vector<int>
#define vp vector<pair<int,int>>
#define pb push_back
#define pp pair<int,int>
#define ff first
#define ss second
#define S set<int>
#define all(v) v.begin(),v.end()
#define gr greater<int>()
#define show2(a, b) cout<<a<<' '<<b<<endl;
#define show3(a, b, c) cout<<a<<' '<<b<<' '<<c<<endl;
const long long mod=1000000007;
const int N=1e5+5;
const long double PI=3.14159265358;
vector<vector<int>> adj;
bool vis[N];
int c;
void dfs(int j){
vis[j]=true;
c++;
for(auto u:adj[j]){
if(!vis[u]) dfs(u);
}
}
int32_t main(){
int t=1;
//cin>>t;
while(t--){
int a,b,c,d;
cin>>a>>b>>c>>d;
int z=d*c-b;
if(z<=0) cout<<-1;
else{
int ans=a/z;
if(a%z) ans++;
cout<<ans;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
if(b >= d * c){
cout << -1 << endl;
return 0;
}
long long i = 1;
while(a + b * i > d * c * i) i++;
cout << i << endl;
return 0;
} |
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cctype>
using namespace std;
template <typename T>
inline void read(T&x){
x=0; char temp=getchar(); bool f=false;
while(!isdigit(temp)){if(temp=='-') f=true; temp=getchar();}
while(isdigit(temp)){x=(x<<1)+(x<<3)+temp-'0'; temp=getchar();}
if(f) x=-x;
}
template <typename T>
void print(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) print(x/10);
putchar(x%10+'0');
}
typedef long long ll;
const int MAXN = 2e5+5;
const ll mod = 998244353;
inline ll ksm(ll base,ll b){
ll res=1;
while(b){
if(b&1) res=res*base%mod;
base=base*base%mod,b>>=1;
}
return res;
}
//basic
int n;
//Union-Find Set
int pre[MAXN],cnt;
inline void Init(){for(register int i=1;i<=n;i++) pre[i]=i;}
int FindRoot(int id){return pre[id]==id? id:pre[id]=FindRoot(pre[id]);}
inline void Unite(int id1,int id2){id1=FindRoot(id1),id2=FindRoot(id2); if(id1!=id2) pre[id2]=id1;}
int main(){
read(n);
Init();
for(register int i=1,x;i<=n;i++) read(x),Unite(i,x);
for(register int i=1;i<=n;i++) cnt+=(FindRoot(i)==i);
print((ksm(2,cnt)+mod-1)%mod);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
struct dsu {
vector<int> p;
vector<int> sz;
vector<map<int, int>> c;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
c.resize(n);
sz.assign(n, 1);
}
inline int get(int x) {
if (p[x] == x) {
return x;
} else {
return p[x] = get(p[x]);
}
}
inline bool unite(int x, int y) {
x = get(x);
y = get(y);
if (x == y) {
return false;
}
if (sz[x] > sz[y]) {
swap(x, y);
}
p[x] = y;
sz[y] += sz[x];
for (auto e : c[x]) {
c[y][e.first] += e.second;
}
return true;
}
inline bool same(int x, int y) {
return (get(x) == get(y));
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> c(n);
dsu uf(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
uf.c[i][c[i]] = 1;
}
while (q--) {
int t, x, y;
cin >> t >> x >> y;
if (t == 1) {
x--, y--;
uf.unite(x, y);
} else {
x--;
x = uf.get(x);
cout << uf.c[x][y] << '\n';
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int N;
cin >> N;
vector<vector<int>> child(N+1);
vector<int> par(N+1, 0);
for (int i = 2; i <= N; i++) {
int p;
cin >> p;
child[p].push_back(i);
par[i] = p;
}
vector<int> size(N+1, 1);
vector<int> cplus(N+1, -1);
for (int now = N; now >= 1; now--) {
for (int c : child[now]) size[now] += size[c];
vector<int> odd = {-10000000}, even = {-10000000};
bool turn = true;
for (int c : child[now]) {
if (size[c]%2 == 1) odd.push_back(cplus[c]);
else even.push_back(cplus[c]);
}
sort(odd.begin(), odd.end(), greater<int>());
sort(even.begin(), even.end(), greater<int>());
int k = odd.size();
int l = even.size();
int op = 0, ep = 0;
k--;l--;
//cout << k << " " << l << endl;
while (op < k || ep < l) {
if (even[ep] >= 0 || op == k) {
if (turn) cplus[now] += even[ep];
else cplus[now] -= even[ep];
ep++;
}else {
if (turn) cplus[now] += odd[op];
else cplus[now] -= odd[op];
op++;
turn = !turn;
}
}
}
cout << (N-cplus[1])/2 << endl;
return 0;
} | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
/************************************************/
#define rep(i,n) for(int i=0;i<n;i++)
#define m_p make_pair
#define pb push_back
#define fr first
#define se second
#define ford(i,n) for(int i=n-1;i>=0;i--)
#define forn(i,a,n) for(int i=a;i<n;i++)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define sz(s) (int)(s.size())
#define all(s) s.begin(),s.end()
#define zero(x) memset(x,0,sizeof(x))
#define vii vector<pair<int,int> >
#define mpis map<int,string>
#define mpii map<int,int>
#define mpsi map<string,int>
#define re return
#define mod 1000000007
/************************************************/
using namespace std;
long long get(){
char c=getchar();
long long x=0LL;
while(c<'0'||c>'9')
c=getchar();
while(c>='0'&&c<='9'){
x*=10LL;
x+=(c-'0');
c=getchar();
}
return x;
}
string i_t_s(int x){
string t="";
while(x){
t+=x%10+'0';
x/=10;
}
reverse(all(t));
re t;
}
int s_t_i(string t){
int x=0;
rep(i,sz(t)){
x=x*10+(t[i]-'0');
}
re x;
}
ll q_p(ll x,ll y){
ll res=1;
x%=mod;
while(y){
if(y%2){
res=res*x;
res%=mod;
}
y/=2;
x=x*x;
x%=mod;
}
re res;
}
bool ok(int x,int y,int n,int m){
re(x>=0&&x<n&&y>=0&&y<m);
}
bool isprime(int x){
if(x<2)
re false;
for(int i=2;i*i<=x;i++)
if(x%i==0)
re false;
re true;
}
int dx[4]={0,-1,0,1},dy[4]={1,0,-1,0};
int n;
ll a[3001];
ll lst[3001][3001];
ll prv[3001];
ll dp[3001][3001];
int main(){
ios::sync_with_stdio(0);
cin>>n;
rep(i,n)
cin>>a[i];
rep(i,n)
prv[i+1]=prv[i]+a[i];
lst[1][0]=1;
forn(i,1,n+1){
forn(j,1,i+1){
dp[i][j]=lst[j][prv[i]%j];
}
forn(j,1,i+1){
lst[j+1][prv[i]%(j+1)]+=dp[i][j];
lst[j+1][prv[i]%(j+1)]%=mod;
}
}
// forn(i,1,n+1)
// cout<<prv[i]<<" ";
// cout<<"\n";
// forn(i,1,n+1){
// forn(j,1,i+1)
// cout<<dp[i][j]<<" ";
// cout<<"\n";
// }
ll ans=0;
forn(i,1,n+1){
ans+=dp[n][i];
ans%=mod;
}
cout<<ans;
re 0;
}
/*
检查循环是rep(i,n)还是rep(i,m)!!
long long所要的时间比int长!!
没有long long必要不写long long!!
写公式前先想一想!!
二分前看一看边界对不对，有没有特殊值!!
提交前要测特殊数据（边界上的）!!
*/
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,V,P,i,X;
cin >> N >> X;
for(X=X*100,i=1;i<=N;i++){
cin >> V >> P;
X=X-V*P;
if(X<0){
cout << i << endl;
return 0;
}
}
cout << "-1" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
ld eps = 1e-9;
int main(){
fast_io;
int n, x;
cin >> n >> x;
ld s = 0;
int ans = -1;
for(int i = 0; i < n; i ++){
ld v, p;
cin >> v >> p;
s += (v * p) / 100;
if(ans == -1 && s - x > eps){
ans = i + 1;
}
}
cout << ans;
return 0;
}
|
#include<bits/stdc++.h>
#define forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define m_p make_pair
#define pb push_back
#define fi first
#define se second
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
#define db long double
using namespace std;
const int N=100010;
int n;
db a[N];
db check(db x){
db res=0.0;
rep(i,n){
res+=a[i]-min(2*x,a[i]);
}
return res/n+x;
}
int main(){
ios::sync_with_stdio(0);
cin>>n;
rep(i,n)cin>>a[i];
sort(a,a+n);
db ans=1e9;
int l=0,r=n-1;
while(l<=r){
if(l+2==r||l+1==r||l==r){
db rs=check(a[l]/2);
ans=min(ans,rs);
if(l+1<=r)rs=check(a[l+1]/2);
ans=min(ans,rs);
if(l+2<=r)rs=check(a[l+2]/2);
ans=min(ans,rs);
break;
}
int lm=l+(r-l)/2;
int rm=l+(r-l)/2;
db cl=check(a[lm]/2),cr=check(a[rm]/2);
if(cl>cr)
r=rm;
else
l=lm;
ans=min(ans,cl);
ans=min(ans,cr);
}
/*
rep(i,n){
cout<<fixed<<setprecision(20)<<check(a[i]/2)<<"\n";
ans=min(ans,check(a[i]/2));
}
*/
cout<<fixed<<setprecision(20)<<ans<<"\n";
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;
// using namespace atcoder;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> p32;
typedef pair<ll, ll> p64;
typedef pair<p64, p64> pp64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<ll> v32;
typedef vector<vector<ll>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln '\n'
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define zero ll(0)
#define set_bits(x) __builtin_popcountll(x)
// #define mll modll998244353
ll mpow(ll a, ll b)
{
if (a == 0)
return 0;
if (b == 0)
return 1;
ll t1 = mpow(a, b / 2);
t1 *= t1;
t1 %= MOD;
if (b % 2)
t1 *= a;
t1 %= MOD;
return t1;
}
ll mpow(ll a, ll b, ll p)
{
if (b == 0)
return 1;
if (a == 0)
return 0;
ll t1 = mpow(a, b / 2, p);
t1 *= t1;
t1 %= p;
if (b % 2)
t1 *= a;
t1 %= p;
return t1;
}
ll modinverse(ll a, ll m)
{
ll m0 = m;
ll 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;
}
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
ll range(ll l, ll r)
{
return l + mt() % (r - l + 1);
}
ll rev(ll v)
{
return mpow(v, MOD - 2);
}
ll ceil(ll p, ll q)
{
return (p + q - 1) / q;
}
vv64 gr;
v64 dep;
ll ans;
ll f(ll v, ll p, ll k){
ll alr = 0;
for(auto it : gr[v]) if(it!=p){
alr = max(alr,f(it,v,k));
dep[v] = max(dep[v],dep[it]+1);
}
if(dep[v]<=alr){
dep[v]=0;
}
else if(dep[v]==k){
ans++;
dep[v]=0;
return k-1;
}
else if(p==-1){
ans++;
}
return alr-1;
}
void solve()
{
ll n,k;
cin >> n >> k;
gr.resize(n);
dep.resize(n);
forn(i,n-1){
ll a,b;
cin >> a >> b;
a--,b--;
gr[a].pb(b);
gr[b].pb(a);
}
ll l = 1,r = n/2;
while(l<r){
ll mid = (l+r)/2;
ans = 0;
forn(i,n) dep[i]=1;
f(0,-1,mid+1);
if(ans>k){
l = mid+1;
}
else r = mid;
}
cout << l << ln;
}
int main()
{
fast_cin();
ll t = 1;
// cin >> t;
forn(i, t)
{
// cout << "Case #" << i+1 << ": ";
solve();
}
return 0;
} |
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int now[15];
void getstring(int n){
now[0]=0;
while(n!=0){
now[now[0]+1]=n%10;
now[0]++;
n=n/10;
}
sort(now+1,now+now[0]+1);
// for(int i=1;i<=now[0];i++){
// cout<<now[i]<<endl;
// }
}
int main(){
int n,k,l;
cin>>n>>k;
while(k>0){
getstring(n);
l=n;
n=0;
int temp=1;
for(int i=1;i<=now[0];i++){
n+=temp*(now[i]-now[now[0]+1-i]);
temp=temp*10;
}
//cout<<n<<endl;
k--;
if(n==l){
break;
}
}
cout<<n<<endl;
return 0;
} | #include<iostream>
#include<string>
#include<queue>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//学习到了 string的函数 to_string() ,reverse(s.begin(),s.end()), stol
int main()
{
int N;
int k;
cin >> N >> k;
for (int i = 0; i < k; i++)
{
string S = to_string(N);
sort(S.begin(), S.end());
string down =S ;
reverse(S.begin(), S.end());
string up = S;
N = stol(up) - stol(down);
}
cout << N << endl;
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define readFast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fin cin
#define ll long long
#define sz(x) (int)(x).size()
#define all(v) v.begin(), v.end()
#define output(x) ((int)x && cout << "YES\n") || cout << "NO\n";
#define ld long double
#define pii pair<int,int>
using namespace std;
#ifdef LOCAL
#define read() ifstream fin("date.in.txt")
#else
#define read() readFast
#endif // LOCAL
const int N = 2005;
int main() {
read();
int a[4];
for (int i = 1; i <= 3; ++i)
fin >> a[i];
sort(a + 1, a + 4);
if(a[3] - a[2] == a[2] - a[1])
cout << "Yes\n";
else
cout << "No\n";
return 0;
} /*stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
~Benq~*/
| #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;cin>>a>>b>>c;
if(c==0)
a>b?cout<<"Takahashi"<<endl:cout<<"Aoki"<<endl;
else
b>a?cout<<"Aoki"<<endl:cout<<"Takahashi"<<endl;
}
/* * * * *
* * * * *
* * * * *
* * * * * *
* * * * * *************
* * * * * * *
* * * * * * *
* * * * * * *
* * ************** * */
|
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define int long long
#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
#define sz 1
ll F[sz],R[sz];
void make(){
F[0] = 1;
for(int i=1;i<sz;i++) F[i] = F[i-1]*i%mod;
for(int i=0;i<sz;i++) R[i] = modpow(F[i],mod-2);
}
ll C(int a,int b){
if(b < 0 || a < b) return 0;
return F[a]*R[b]%mod*R[a-b]%mod;
}
int a[805][805],rui[805][805];
void solve(){
int n, k;
cin>>n>>k;;
repn(i,n)repn(j,n)cin>>a[i][j];
int lb=-1,ub=1e9;
while(ub-lb>1){
int mid=(lb+ub)/2;
repn(i,n)repn(j,n)rui[i][j]=a[i][j]<=mid;
repn(i,n)repn(j,n)rui[i][j]=rui[i][j]+rui[i-1][j]+rui[i][j-1]-rui[i-1][j-1];
int ok = 0;
repn(i,n-k+1)repn(j,n-k+1){
int sum = rui[i+k-1][j+k-1];
sum -= rui[i-1][j+k-1] + rui[i+k-1][j-1];
sum += rui[i-1][j-1];
if(sum >= (k*k+1)/2) ok = 1;
}
if(ok)ub=mid; else lb=mid;
}
o(ub);
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int t; t = 1; //cin >> t;
while(t--) solve();
}
| #include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 1e5 + 5;
struct elm{
int a, b, c;
bool operator < (const elm &other){
return c < other.c;
}
};
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, k, p;
cin >> n >> k;
p = k * k - (k * k / 2);
vector<elm> x;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
int inp;
cin >> inp;
x.push_back({i, j, inp});
}
}
sort(x.begin(), x.end());
int l = 0, r = n * n - 1;
while (l < r){
int mid = l + r >> 1, can = 0;
int has[n][n]{}, pre[n][n + 1]{};
for (int i = 0; i <= mid; i++) has[x[i].a][x[i].b] = 1;
for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) pre[i][j + 1] = pre[i][j] + has[i][j];
for (int j = 0; j <= n - k; j++){
int tmp = 0;
for (int i = 0; i < n; i++){
tmp += pre[i][j + k] - pre[i][j];
if (i >= k) tmp -= pre[i - k][j + k] - pre[i - k][j];
if (tmp >= p) can = 1;
//cout << mid << ' ' << tmp << '\n';
}
}
if (can) r = mid;
else l = mid + 1;
}
cout << x[l].c;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define T third
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<pair<int,int>> vp;
typedef vector<long long> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvll;
const int C=1e9+7;
const int C1=998244353;
void yes(){
cout<<"YES\n";
}
void no(){
cout<<"NO\n";
}
ll binpow(ll a, ll b, ll m=C) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
//Variables********************************************
//Functions********************************************
//*****************************************************
void solve(){
ll n; cin>>n;
ll ans=LLONG_MAX;
for(int i=0;i<=60;i++){
if(pow(2,i)>n) break;
ll p=pow(2,i);
ll r=n%p;
ll c=(n-r)/p;
ans=min(ans,i+c+r);
}
cout<<ans<<endl;
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t=1; //cin>>t;
int x{};
while(t--){
//cout<<"Case #"<<x<<": "; x++;
solve();
}
}
| #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
ll tmp[600001], *A = tmp + 200000, *B = tmp + 400000;
void pakuri_sort(int N, ll A[]) {
const int b = 8;
rep(k, 4) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--) tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--) A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
const int CM = 400001, CL = 12;
char cn[CM + CL], * ci = cn + CM + CL, * owa = cn + CM, ct;
const ll ma0 = 1157442765409226768;
const ll ma1 = 1085102592571150095;
const ll ma2 = 71777214294589695;
const ll ma3 = 281470681808895;
const ll ma4 = 4294967295;
inline int getint() {
if (ci - owa > 0) {
memcpy(cn, owa, CL);
ci -= CM;
fread(cn + CL, 1, CM, stdin);
}
ll tmp = *(ll*)ci;
if ((tmp & ma0) ^ ma0) {
int dig = 68 - __builtin_ctzll((tmp & ma0) ^ ma0);
tmp = tmp << dig & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += (72 - dig >> 3);
}
else {
tmp = tmp & ma1;
tmp = tmp * 10 + (tmp >> 8) & ma2;
tmp = tmp * 100 + (tmp >> 16) & ma3;
tmp = tmp * 10000 + (tmp >> 32) & ma4;
ci += 8;
if ((ct = *ci++) >= '0') {
tmp = tmp * 10 + ct - '0';
if (*ci++ == '0') {
tmp = tmp * 10;
ci++;
}
}
}
return tmp;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
rep(i, N) {
A[i] = ll(i) << 32 | getint();
B[i] = ll(i) << 32 | getint();
}
pakuri_sort(N, A);
pakuri_sort(N, B);
const ll ma = (1ll << 32) - 1;
rep(i, N) {
auto tmp = (A[i] & ma) < (B[N - 1 - i] & ma);
cn[A[i] >> 31] = tmp;
cn[B[N - 1 - i] >> 31 | 1] = tmp;
}
int c = -1, pn = 0;
rep(i, N << 1) {
if (c != -1 && pn == cn[i]) {
cn[c] = '(';
cn[i] = ')';
c = tmp[c];
pn ^= 1;
}
else {
pn = cn[i];
tmp[i] = c;
c = i;
}
}
fwrite(cn, 1, N << 1, stdout);
Would you please return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;
constexpr int P = 998244353;
ll powmod(ll n, ll k) {
ll r = 1, t = n % P;
for (; k != 0; k /= 2) {
if (k & 1) r = r * t % P;
t = t * t % P;
}
return r;
}
ll modinv(ll n) {
return powmod(n, P - 2);
}
int dp[5000][5000];
char d[5000][5000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, k;
cin >> h >> w >> k;
for (int l = 0; l < k; l++) {
int i, j;
char c;
cin >> i >> j >> c;
i--; j--;
d[i][j] = c == 'R' ? 1 : c == 'D' ? 2 : 3;
}
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
ll t = 0;
if (i == 0 && j == 0) {
t = 1;
} else {
if (j > 0 && d[i][j - 1] != 2) {
int s = 1;
if (d[i][j - 1] == 0) s = 2;
t += dp[i][j - 1] * s;
}
if (i > 0 && d[i - 1][j] != 1) {
int s = 1;
if (d[i - 1][j] == 0) s = 2;
t += dp[i - 1][j] * s;
}
}
if (d[i][j] != 0) t *= 3;
dp[i][j] = t % P;
}
}
ll r = dp[h - 1][w - 1];
int t = h * w - k - (h + w - 1);
if (d[h - 1][w - 1] == 0) r = r * 3 % P;
if (t > 0) {
r = r * powmod(3, t) % P;
} else if (t < 0) {
r = r * powmod(modinv(3), -t) % P;
}
cout << r << endl;
//通らない場所の塗り方も関係するじゃん！
//通るマスの数はH+W-1
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>;
#define LLINF ((long long)1e18)
#define INF int(1e9+1e6)
#define MAXN (200006)
ll n,k,A[MAXN],C[302][302],mod=998244353,sum[MAXN],ans[302],co[MAXN];
ll qexp(ll x,ll e){
ll sum=1;
for(;e;e>>=1,x*=x,x%=mod)if(e&1)sum*=x,sum%=mod;
return sum;
}
int main(){
FAST
cin>>n>>k;
FOR(i,1,n)cin>>A[i];
FOR(i,0,300) C[i][0]=1;
FOR(i,1,300) FOR(j,1,300) C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod;
FOR(i,1,n){
ll co = 1;
FOR(j,0,k){
sum[j] += co, sum[j] %= mod;
co *= A[i], co %= mod;
}
}
fill(co,co+MAXN,1);
FOR(i,1,k){
ll ans = 0;
FOR(j,0,i){
ans += sum[j] * sum[i-j] % mod * C[i][j] % mod, ans %= mod;
}
FOR(z,1,n){
co[z] *= A[z] * 2 % mod, co[z] %= mod;
ans -= co[z], ans += mod, ans %= mod;
}
ans *= qexp(2, mod-2), ans %= mod;
cout<<ans<<'\n';
}
}
|
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;
/*
const int mod=;
inline int upd(const int &x){return x+(x>>31&mod);}
inline void add(int &x,int y){x=upd(x+y-mod);}
inline void iadd(int &x,int y){x=upd(x-y);}
int qpow(int x,int y){
int res=1;
for (;y;y>>=1,x=1LL*x*x%mod)
if (y&1) res=1LL*res*x%mod;
return res;
}
*/
/*
typedef pair<int,int> P;
*/
#define rep(i,l,r) for (int i(l);i<=(r);i++)
#define per(i,l,r) for (int i(r);i>=(l);i--)
int n;
void solve(){
n=read();
printf("%d\n",(1<<n)-1);
rep(i,1,(1<<n)-1){
rep(j,0,(1<<n)-1) putchar("AB"[__builtin_parity(i&j)]);
puts("");
}
}
int main()
{
for (int T=1;T--;) solve();
} | #include <cstdio>
#include <queue>
using namespace std;
int main(){
int n;
scanf("%d", &n);
vector<int> a(n*2);
for(int& i: a)
scanf("%d", &i);
priority_queue<int> q;
long long ans=0;
for(int i = 0;i < n;i ++){
q.push(a[i]);
q.push(a[n*2-1-i]);
ans+=q.top();
q.pop();
}
printf("%lld\n", ans);
} |
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstring>
#include <regex>
#include <cmath>
#include <algorithm>
#include <vector>
#include <list>
#include <map>
#include <unordered_set>
#include <queue>
#include <unordered_map>
#include <set>
#include <cassert>
#include <climits>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define repd(i, n) for(ll i = (n) - 1ll; i >= 0; --i)
#define FOR(i, a, b) for(ll i = a; i < ll(b); ++i)
#define FORD(i, a, b) for(ll i = a; i > ll(b); --i)
#define foreach(i, itr) for(auto& i : (itr))
#define asort(arr, size) std::sort(arr, arr + size)
#define dsort(arr, size) std::sort(arr, arr + size, [](auto a, auto b) { return a > b; })
#define cauto const auto&
#define bit(n) (1LL << (n))
////////////////////////////////////
// ここから下に任意のコードを書く //
////////////////////////////////////
int d[200];
int h[200];
int main()
{
int N, D, H;
cin >> N >> D >> H;
rep(i, N) cin >> d[i] >> h[i];
double res = 0;
rep(i, N) {
double dx = D - d[i];
double dy = H - h[i];
double slope = dy / dx;
// y = slope * x + n
// H = slope * D + n
// H - n = slope * D
// -n = slope * D - H
// n = -(slope * D - H)
auto n = -(slope * D - H);
res = max(res, n);
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N], d[N], h[N];
int n, m, H, D;
bool chck(double x){
for(int i=0; i<n; ++i){
double tmp = (H-x)/(double)D;
if(tmp*d[i]+x<h[i])
return 0;
}
return 1;
}
int main(){
scanf("%d%d%d",&n,&D,&H);
for(int i=0; i<n; ++i){
scanf("%d%d",&d[i],&h[i]);
}
double st = 0, nd = 1000, md;
int cnt = 100;
while(cnt--){
md = (st+nd)/2.0;
if(chck(md)){
nd = md;
}
else{
st = md;
}
}
cout<<fixed<<setprecision(9)<<md<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define M 1005
#define LL long long
const LL mod = 1000000007;
int n;
LL f[M];
char Caa, Cab, Cba, Cbb;
inline LL qkpow (LL x, LL y){
LL res = 1;
while (y){
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
signed main (){
scanf ("%d\n%c\n%c\n%c\n%c", &n, &Caa, &Cab, &Cba, &Cbb);
if (n == 3 || n == 2){
printf ("1\n");
return 0;
}
f[1] = 2, f[2] = 3;
for (int i = 3; i <= n; i ++)
f[i] = (f[i - 1] + f[i - 2]) % mod;
if (Cab == 'B'){
if (Cbb == 'B')
printf ("1\n");
else{
if (Cba == 'A'){
printf ("%lld\n", qkpow (2, n - 3));
}
else{
printf ("%lld\n", f[n - 3]);
}
}
}
else{
if (Caa == 'A')
printf ("1\n");
else{
if (Cba == 'B'){
printf ("%lld\n", qkpow (2, n - 3));
}
else{
printf ("%lld\n", f[n - 3]);
}
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define REP(i,k,n) for(ll i=k;i<ll(n);i++)
#define all(a) a.begin(),a.end()
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define UNIQUE(a) sort(all(a));a.erase(unique(all(a)),a.end())
#define decimal cout<<fixed<<setprecision(10)
#define summon_tourist cin.tie(0);ios::sync_with_stdio(false)
using ll=long long;
using P=pair<ll,ll>;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
constexpr ll inf=1001001001001001;
constexpr int INF=1001001001;
constexpr int mod=1000000007;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
void YesNo(bool b){if(b)out("Yes");else out("No");}
void yesno(bool b){if(b)out("yes");else out("no");}
void YESNO(bool b){if(b)out("YES");else out("NO");}
ll modpow(ll a,ll b){ll c=1;while(b>0){if(b&1){c=a*c%mod;}a=a*a%mod;b>>=1;}return c;}
vi calc(ll x){vi v;while(x>0){v.eb(x%10);x/=10;}reverse(all(v));return v;}
int main(){
ll n,x;
cin>>n>>x;
vi a(n);
rep(i,n) cin>>a[i];
vi b;
rep(i,n) if(a[i]!=x) b.eb(a[i]);
outv(b);
}
|
#include<bits/stdc++.h>
#include <algorithm>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define db double
#define ld long double
#define MOD 1000000007
#define inf (1LL << 62)
#define pi acos(-1.0)
#define si(a) scanf("%lld",&a)
#define sd(n) scanf("%lf", &n)
#define for1(i, stop) for(ll i = 1; i <= stop; i++)
#define for0(i, stop) for(ll i = 0; i < stop; i++)
#define rep1(i, start) for(ll i = start; i >= 1; i--)
#define rep0(i, start) for(ll i = (start-1); i >= 0; i--)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define pb(v,a) v.push_back(a)
#define pll pair <ll, ll>
#define mp make_pair
#define pbp(v,a,i) v.push_back(make_pair(a,i))
#define srt(v) sort(v.begin(),v.end())
#define rv(v) reverse(v.begin(),v.end())
#define ms(n, i) memset(n, i, sizeof(n))
#define debug printf("Debug\n");
#define en '\n'
#define _fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
/*typedef tuple<ll,ll,ll>tpl;
ll bigmod(ll n,ll pow)
{
if(pow==0)
return 1;
if(pow==1)
return n%MOD;
ll ans=bigmod(n,pow/2);
ans=(ans*ans)%MOD;
if(pow%2==1)
{
ans=(ans*n)%MOD;
}
return ans%MOD;
}
ll fact[1000005];
ll nCr(ll n,ll r)
{
ll ans=fact[n];
ans=(ans*bigmod(fact[r],MOD-2))%MOD;
ans=(ans*bigmod(fact[n-r],MOD-2))%MOD;
return ans;
} */
/*ll NcR(ll n, ll r)
{
ll p = 1, k = 1;
if (n - r < r)
r = n - r;
if (r != 0)
{
while (r)
{
p *= n;
k *= r;
ll m = __gcd(p, k);
p /= m;
k /= m;
n--;
r--;
}
}
else
p = 1;
return p;
} */
int main()
{
_fastio
double a,b;
cin>>a>>b;
cout<<setprecision(6)<<fixed<<(a/100.0)*b<<en;
}
| #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
using namespace std;
char s1[100],s2[100],s3[110];
int len1,len2,len3,cnt,nm[100],l,s[100];
bool bz[100],bz2[100];
void dg(int x)
{
if(x > l)
{
long long x = 0,y = 0,z = 0;
if(nm[s[s1[0] - 97]] == 0 || nm[s[s2[0] - 97]] == 0 || nm[s[s3[0] - 97]] == 0) return;
fo(i,0,len1 - 1) x = x * 10 + nm[s[s1[i] - 97]];
fo(i,0,len2 - 1) y = y * 10 + nm[s[s2[i] - 97]];
fo(i,0,len3 - 1) z = z * 10 + nm[s[s3[i] - 97]];
if(x + y == z && x > 0 && y > 0 && z > 0)
{
printf("%lld\n%lld\n%lld\n",x,y,z);
exit(0);
}
return;
}
fo(i,0,9)
{
if(bz2[i]) continue;
nm[x] = i,bz2[i] = 1,dg(x + 1),bz2[i] = 0;
}
}
int main()
{
scanf("%s%s%s",s1,s2,s3),len1 = strlen(s1),len2 = strlen(s2),len3 = strlen(s3);
fo(i,0,len1 - 1) bz[s1[i] - 97] = 1;
fo(i,0,len2 - 1) bz[s2[i] - 97] = 1;
fo(i,0,len3 - 1) bz[s3[i] - 97] = 1;
fo(i,0,25)
{
cnt += bz[i];
if(bz[i]) s[i] = ++l;
}
dg(1),puts("UNSOLVABLE");
return 0;
}
|
#include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// #include <atcoder/all>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vs = vector<string>;
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n)? "YES": "NO") << endl
#define Yes(n) cout << ((n)? "Yes": "No") << endl
#define rept(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 fore(x, a) for(auto& (x) : (a))
#define reptll(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define repll(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#define VECCIN(x) for(auto& youso_: (x)) cin >> youso_
#define VECCOUT(x) for(auto& youso_: (x)) cout << youso_ << " ";cout << endl
#define pb push_back
#define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INFL = numeric_limits<ll>::max() / 4;
const int INF = 1e9;
const int MOD = 1e9 + 7;
//数列a(a[0],a[1],…,a[n-1])についての区間和と点更新を扱う
//区間和,点更新,二分探索はO(log{n})で動作する
class BIT {
public:
//データの長さ
ll n;
//データの格納先
vector<ll> a;
//コンストラクタ
BIT(ll n):n(n),a(n+1,0){}
//a[i]にxを加算する
void add(ll i,ll x){
i++;
if(i==0) return;
for(ll k=i;k<=n;k+=(k & -k)){
a[k]+=x;
}
}
//a[i]+a[i+1]+…+a[j]を求める
ll sum(ll i,ll j){
return sum(j)-sum(i-1);
}
//a[0]+a[1]+…+a[i]を求める
ll sum(ll i){
i++;
ll s=0;
if(i==0) return s;
for(ll k=i;k>0;k-=(k & -k)){
s+=a[k];
}
return s;
}
//a[0]+a[1]+…+a[i]>=xとなる最小のiを求める(任意のkでa[k]>=0が必要)
ll lower_bound(ll x){
if(x<=0){
//xが0以下の場合は該当するものなし→0を返す
return 0;
}else{
ll i=0;ll r=1;
//最大としてありうる区間の長さを取得する
//n以下の最小の二乗のべき(BITで管理する数列の区間で最大のもの)を求める
while(r<n) r=r<<1;
//区間の長さは調べるごとに半分になる
for(int len=r;len>0;len=len>>1) {
//その区間を採用する場合
if(i+len<n && a[i+len]<x){
x-=a[i+len];
i+=len;
}
}
return i;
}
}
};
int main(){
optimize_cin();
int N;
cin >> N;
vll A(N), B(N);
vector<pll> paa(N), pab(N);
ll SA = 0, SB = 0;
rep(i, N) {cin >> A[i]; A[i] += i; paa[i] = make_pair(A[i], i);}
rep(i, N) {cin >> B[i]; B[i] += i; pab[i] = make_pair(B[i], i);}
sort(ALL(paa));
sort(ALL(pab));
vll C(N);
rep(i, N) {
if(paa[i].first != pab[i].first) {
cout << -1 << endl;
return 0;
}
C[paa[i].second] = pab[i].second;
}
// rep(i, N){
// cout << C[i] << endl;
// }
BIT bit(N);
ll ans = 0;
rep(i, N){
ans += i - bit.sum(C[i]);
bit.add(C[i], 1);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353
#define PI 3.141592653
#define INF 100000000000000 //14
//cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
vector<ll> edges[1100][26];
vector<vector<ll>> paths(1100000);
ll dist[1100000];
int main(){
ll n, m; cin >> n >> m;
REP(i,m) {
ll a, b; char c; cin >> a >> b >> c; a--; b--; c-='a';
edges[a][c].pb(b); edges[b][c].pb(a);
}
REP(i,n) REP(j,n) {
ll from = i*n+j;
REP(k,26) {
for (ll ito : edges[i][k]) for (ll jto : edges[j][k]) {
ll to = ito*n+jto;
paths[from].pb(to);
}
}
}
REP(i,1100000) dist[i]=INF;
queue<ll> q;
q.push(n-1); dist[n-1]=0;
while (!q.empty()) {
ll nat = q.front(); q.pop();
for (ll nex : paths[nat]) {
if (dist[nex]!=INF) continue;
dist[nex]=dist[nat]+1;
q.push(nex);
}
}
ll ans = INF;
REP(i,n) {
ans = min(ans,2*dist[i*n+i]);
REP(j,26) for (ll to : edges[i][j]) {
ans = min(ans,2*dist[i*n+to]+1);
}
}
if (ans==INF) cout << -1 << endl;
else cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(x, L, R) for(int x = (L), _x = (R); x <= _x; x++)
#define per(x, R, L) for(int x = (R), _x = (L); x >= _x; x--)
#define broken fprintf(stderr, "running on %s %d\n", __FUNCTION__, __LINE__)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define SZ(v) (int)(v).size()
#define ALL(x) (x).begin(), (x).end()
#define x first
#define y second
#define mp make_pair
#define pb push_back
template<typename T> inline bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template<typename T> inline bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
typedef pair<int, int> par;
typedef long long LL;
typedef unsigned long long uLL;
typedef double db;
const int N = 2e5 + 10;
struct Edge {
int to, nxt;
}e[N << 1];
int head[N], tot = 0;
int n, ans[N], idt = 1;
int pa[N], vis[N];
int mxd, id;
void adde(int u, int v) { e[++tot] = Edge{v, head[u]}, head[u] = tot; }
void Dfs(int u, int fa, int dep) {
pa[u] = fa;
if(dep > mxd) {
id = u, mxd = dep;
}
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(v == fa) continue;
Dfs(v, u, dep + 1);
}
return;
}
void con(int u, int fa) {
ans[u] = idt;
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(v == fa || vis[v]) continue;
idt++;
con(v, u);
idt++;
}
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(v == fa || !vis[v]) continue;
idt++;
con(v, u);
}
return;
}
int main() {
cin >> n;
for(int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
adde(u, v), adde(v, u);
}
mxd = id = -1;
Dfs(1, 0, 0);
int S = id;
mxd = id = -1;
Dfs(S, 0, 0);
int T = id;
for(int u = T; u; u = pa[u]) vis[u] = 1;
con(S, 0);
for(int i = 1; i <= n; i++) cout << ans[i] <<" ";
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef map<ll, ll> ml;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {return (a % b + b) % b;}
ll quo(ll a, ll b) {return (a - mod(a, b)) / b;}
template <typename T, typename U> bool chmin(T &a, const U b) {if(a > b) {a = b; return 1;} return 0;}
template <typename T, typename U> bool chmax(T &a, const U b) {if(a < b) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
ll itr1, itr2, M1 = 0, M2 = 0;
bool found = 0;
vl e, d1, d2;
vb diam;
vvl G;
void dfs1(ll v) {
for(ll u: G[v]) {
if(d1[u] == INF) {
d1[u] = d1[v] + 1;
dfs1(u);
}
}
return;
}
void dfs2(ll v) {
for(ll u: G[v]) {
if(d2[u] == INF) {
d2[u] = d2[v] + 1;
dfs2(u);
}
}
return;
}
void dfs3(ll v) {
if(v == itr2) {
found = 1;
return;
}
for(ll u: G[v]) {
if(found) break;
if(d2[v] < d2[u]) dfs3(u);
if(found) diam[u] = 1;
}
return;
}
ll dfs4(ll v, ll num) {
e[v] = num;
ll last = -1;
for(ll u: G[v]) {
if(e[u] == INF) {
if(diam[u]) {
last = u;
continue;
}
num = dfs4(u, num+1);
}
}
if(last != -1) num = dfs4(last, num+1);
if((rand()%4 == 0) && !diam[v]) e[v] = num;
return num+1;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n, a, b;
cin >> n;
e = vl(n, INF);
d1 = vl(n, INF);
d2 = vl(n, INF);
diam = vb(n, 0);
G = vvl(n);
rep(_, n-1) {
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
d1[0] = 0;
dfs1(0);
rep(i, n) if(chmax(M1, d1[i])) itr1 = i;
d2[itr1] = 0;
dfs2(itr1);
rep(i, n) if(chmax(M2, d2[i])) itr2 = i;
diam[itr1] = 1;
dfs3(itr1);
dfs4(itr1, 1);
rep(i, n) cout << e[i] << ' ';
cout << newl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
char* cstr = new char[N];
strcpy(cstr, S.c_str());
bool f = true;
for(int i = 0; i < N; ++ i){
if((i + 1) % 2 == 1){ // 奇数
if(+cstr[i] < 91){
f = false;
break;
}
}else{ // 偶数
if(+cstr[i] > 96){
f = false;
break;
}
}
}
if(f){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
| #include<iostream>
#include <cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
int main(){
bool check[202020] = {}; int n; cin >> n;
int now = 0;
rep(i, n){
int x; cin >> x; check[x] = true;
if(!check[now]){
cout << now << endl; continue;
}
else{
while(check[now]){
now++;
}
}
cout << now << endl;
}
} |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author kant97
*/
#include <iostream>
#include <fstream>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#ifndef CONTESTS_CPP_MY_ALIASES_HPP
#define CONTESTS_CPP_MY_ALIASES_HPP
#include <utility>
#include <cstdint>
#include <limits>
using pii = std::pair<int, int>;
using pll = std::pair<int64_t, int64_t>;
using pli = std::pair<int64_t, int>;
using tiii = std::tuple<int, int, int>;
using ui = uint32_t;
using ll = int64_t;
using ull = uint64_t;
#if __x86_64__ && __GNUG__
using int128 = __int128;
using uint128 = unsigned __int128;
#else
using int128 = ll;
using uint128 = ull;
#endif
using vc = std::vector<char>;
using vi = std::vector<int>;
using vll = std::vector<ll>;
using vull = std::vector<ull>;
#define fori(n) for (int i = 0; (i) < (int) (n); ++i)
#define forj(n) for (int j = 0; (j) < (int) (n); ++j)
#define rofi(n) for (int i = (int) (n); (i) >= 0; --i)
#define rofj(n) for (int j = (int) (n); (j) >= 0; --j)
#define forn(i, n) for(int i = 0; i < (int) (n); ++i)
#define fore(i, l, r) for(int i = (int) (l); i < (int) (r); ++i)
#define sqr(x) ((x)*(x))
#define pow2(x) ((ull)1 << static_cast<uint64_t>(x))
#define div2k(x, k) (static_cast<uint64_t>(x) >> static_cast<uint64_t>(k))
#define div2(x) div2k(x, 1ULL)
#define divUP(a, b) ((a)+(b)-1)/(b)
#define lowest_significant_bit(x) (static_cast<ull>(x) & -static_cast<ull>(x))
#define count_set_bits(x) __builtin_popcountll(static_cast<ull>(x))
#define sz(x) (static_cast<int>((x).size()))
#define is_odd(x) static_cast<bool>(static_cast<uint64_t>(x) & 1ULL)
#define is_even(x) (!(is_odd(x)))
#define have_diff_parity(x, y) static_cast<bool>(is_odd(x) ^ is_odd(y))
#define have_same_parity(x, y) (!(have_diff_parity(x, y)))
#define All(x) (x).begin(), (x).end()
#define ENDL "\n"
#define FOR_ALL_TEST_CASES int MyTestCaseCounter; in >> MyTestCaseCounter; while(MyTestCaseCounter--)
#endif //CONTESTS_CPP_MY_ALIASES_HPP
class AHealthMDeath {
public:
void solve(std::istream &in, std::ostream &out) {
int m, h;
in >> m >> h;
if (h % m == 0) out << "Yes" << ENDL;
else out << "No" << ENDL;
}
bool _my_clever_check(std::istream &input, std::istream &juryAnswer, std::istream &myAnswer) {
return false;
}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
AHealthMDeath solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
fflush(stdout);
return 0;
}
| #include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define mkpr make_pair
#define fi(i,a,b) for (ll i=a;i<b;i++)
#define vll vector<ll>
#define vch vector<char>
#define vst vector<string>
#define vpll vector<pll>
#define vii vector<int>
#define vvl vector<vector<ll>>
#define all(v) v.begin(),v.end()
#define rev(v) reverse(v.begin(),v.end())
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(), v.rend())
#define mxe(v) *max_element(all(v))
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define mll map<ll, ll>
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*1ll * (b)) / gcd(a, b)
#define nl "\n"
#define sp " "
#define sz(x) (int)x.size()
using namespace std;
double PI = (acos(-1));
ll md = 1000000007;
//ll md = 998244353;
ll pw(ll a, ll b){ll c=1,m=a;while (b){if (b&1)c=(c*m);m=(m*m);b/=2;}return c;}
ll pwmd(ll a, ll b){ll c = 1, m = a;while (b){if (b & 1)c = ((c * m)) % md;m = (m * m) % md;b /= 2;}return c;}
ll modinv(ll n){return pwmd(n, md - 2);}
ll nc2(ll n){return (1ll * n * (n - 1)) / 2;}
bool prime(ll a){for(int i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll ceel(ll a,ll b){if(a%b==0) return a/b;else return a/b+1;}
#define MAX_SIZE 10005
void Sieve(vector<int> &primes){bool IsPrime[MAX_SIZE];memset(IsPrime, true, sizeof(IsPrime));
for (int p = 2; p * p < MAX_SIZE; p++){if (IsPrime[p] == true){
for (int i = p * p; i < MAX_SIZE; i += p)IsPrime[i] = false;}}
for (int p = 2; p < MAX_SIZE; p++)if (IsPrime[p])primes.push_back(p);}
vector<char> sml={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char> cap={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
void solve(){
ll n;
cin>>n;
ll l[n];
vll v(n+1);
fi(i,0,n)cin>>l[i],v[l[i]]=i+1;
vll vis(n+1,0),q,w;
//fi(i,1,n+1)cout<<v[i]<<nl;
fi(i,1,n){
if(v[i]<=i){
cout<<-1<<nl;
return;
}
for(ll j=v[i]-1;j>=i;j--){
q.pb(j);
}
w.pb(i);
fi(j,i-1,v[i]-2)w.pb(l[j]);
l[v[i]-1]=l[v[i]-2];
i+=max(0ll,v[i]-i-1);
}
ll k=0;
fi(i,0,n-1){
if(w[i]==i+1)k++;
}
if(k==n-1){
fi(i,0,n-1)cout<<q[i]<<nl;
}
else cout<<-1<<nl;
//fi(i,0,n-1)cout<<q[i]<<nl;
}
int main(){
//vector<int> primes;
//Sieve(primes);
fast
ll tests=1;
//cin>>tests;
while(tests--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using vc = vector<char>;
using vvc = vector<vc>;
using vd = vector<long double>;
using vvd = vector<vd>;
using pii = pair<int64_t, int64_t>;
using vvp = vector<vector<pii>>;
int64_t INF = 1e18;
int64_t mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
string ns;
rep(j, k) {
ns = "";
int a;
if (n % 2 == 0) a = n /2;
else a = n;
for(int i = 0; i < n * 2; i += 2) {
if (s[i % n] == s[(i+1) % n]) ns += s[i % n];
else if ((s[i % n] == 'R' && s[(i+1) % n] == 'S') || (s[i % n] == 'P' && s[(i+1) % n] == 'R') || (s[i % n] == 'S' && s[(i+1) % n] == 'P')) ns += s[i % n];
else ns += s[(i+1) % n];
}
s = ns;
n = s.size();
}
cout << ns[0] << endl;
}
| # include <bits/stdc++.h>
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(int i=((int)(n)); i>0; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
#define MOD 1000000007
using namespace std;
using lint = 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; }
int A1, A2, A3, A4;
int main(){
cin >> A1 >> A2 >> A3 >> A4;
cout << min(min(A1, A2), min(A3, A4)) << endl;
return 0;
} |
/*And I thought my jokes were bad*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dbg puts("Viva la vida");
#define CHECK(x) cout << (#x) << " is " << (x) << endl;
#define nl puts("");
#define mp make_pair
#define IN(x) scanf("%d",&x);
#define INL(x) scanf("%lld",&x);
#define OUT(x) printf("%d",x);
#define OUTL(x) printf("%lld",x);
#define MAX 200005
#define MOD 1000000009
#define INF (1 << 31)
#define CASE(x,y) printf("Case %d: %d\n",++x,y);
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define PI acos(-1.0)
#define EPS 1e-19
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define int ll
/*
When I get older
I will be stronger
they'll call me freedom
just like a waving flag
*/
void solve()
{
int j,l,r,m,a,b,c,d,x,y,z,t,p;
unsigned int i,n,k;
cin>>n;
x=n+1;
i=1;
for(j=30;j>=0;j--)
{
k=i+(1LL<<j);
if(k*(k+1)/2<=x)
i=k;
}
cout<<(n-i+1)<<endl;
}
int32_t main()
{
FASTIO
int t=1;
// cin>>t;
while(t--) solve();
return 0;
} | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rp(i, k, n) for (int i = k; i < n; i++)
using ll = long long;
using ld = double;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7ll;
// const ll MOD = 998244353;
const double PI=3.14159265358979323846;
int main() {
ll n; cin >> n;
ll ng = 2ll * (ll)1e9;
ll ok = 0;
while(llabs(ok - ng) > 1ll) {
ll x = (ok+ng) / 2;
if(x * (x+1) / 2 <= (n+1)) ok = x;
else ng = x;
}
cout << (n+1) - ok << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {int N;cin>>N;
vector<long long>A(N),B(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
for(int i=0;i<N;i++)
cin>>B.at(i);
long long c=0;
int d=0;
for(int i=0;i<N;i++)
{d=max<long long>(d,A.at(i));
c=max(c,d*B.at(i));
cout<<c<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int64_t> A(n), B(n);
copy_n(istream_iterator<int64_t>(cin), n, A.begin());
copy_n(istream_iterator<int64_t>(cin), n, B.begin());
int64_t ma = 1, mab = 1;
for (int i = 0; i < n; i++){
ma = max(ma, A[i]);
mab = max(mab, ma * B[i]);
cout << mab << "\n";
}
} |
#include<bits/stdc++.h>
const int mod=3,N=600005;
using namespace std;
struct nd{
int a,b;
nd(int k=1){b=0;if(k)while(k%mod==0)k/=mod,b++;a=k%mod;}
nd(int A,int B){a=A,b=B;}
nd operator*(nd c){
nd as=(nd){a*c.a%mod,b+c.b};
return as;
}
nd operator/(nd c){
nd as=(nd){a*c.a%mod,b-c.b};
return as;
}
int operator~(){return b?0:a;}
}nw;
int a[N],n,ans;
char S[N];
int main(){
a['R']=0,a['W']=1,a['B']=2;
scanf("%d%s",&n,S+1);
for(int i=1;i<=n;i++){
ans+=~nw*a[S[i]];
nd x(n-i),y(i);
nw=nw*x/y;
}
if(!(n&1))ans=ans*2;
if(ans%3==0)printf("R");
else if(ans%3==1)printf("W");
else printf("B");
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#include <bits/stdc++.h>
using namespace std;
/*
前処理: O(MAX_N*MAX_N)
nCk(n,k): nCk の計算。O(1)
*/
const int MAX_N = 60; // n の最大値
vector<vector<long long>> com; // 前計算の結果を保存
// 動的計画法で前処理
void init() {
com.assign(MAX_N, vector<long long>(MAX_N));
com[0][0] = 1;
for (int i = 1; i < MAX_N; ++i) {
com[i][0] = 1;
for (int j = 1; j < MAX_N; j++) {
com[i][j] = (com[i - 1][j - 1] + com[i - 1][j]);
}
}
}
// nCk を取得
long long nCk(int n, int k) {
assert(!(n < k));
assert(!(n < 0 || k < 0));
return com[n][k];
}
int main(){
ll A,B;
ll K;
cin>>A>>B>>K;
init();
string ANS="";
while(A>0LL && B>0LL){
//cout << A << " " << B << " " << K << endl;
if(K <= nCk(A+B-1LL,B)){
ANS = ANS +'a';
A--;
}
else{
ANS = ANS + 'b';
K -= nCk(A+B-1LL,B);
B--;
}
}
if(A == 0LL){
for(int i=0;i<(int)B;i++){
ANS = ANS + 'b';
}
}
else if(B == 0LL){
for(int i=0;i<(int)A;i++){
ANS = ANS + 'a';
}
}
cout << ANS << endl;
} |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
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 a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
// mod m におけるa の逆元
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;
}
// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N, W; cin >> N >> W;
// ll x, y, z; cin >> x >> y >> z;
// ll a, b, c; cin >> a >> b >> c;
// string s; cin >> s;
vector<ll> s(N), t(N), p(N); rep(i, N) cin >> s[i] >> t[i] >> p[i];
vector<ll> a(200200, 0);
bool ok = true;
ll maxt = 0;
rep(i, N) {
a[s[i]] += p[i];
a[t[i]] += -p[i];
if(t[i] > maxt) maxt = t[i];
}
ll ttl = 0;
rep(i, maxt + 1) {
ttl += a[i];
if(ttl > W) ok = false;
}
cout << (ok?"Yes":"No") << endl;
}
int main(void)
{
// ll t; cin >> t; rep(i, t)
solve();
}
| #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, X;
cin >> N >> X;
int num = 0;
int cnt = 0;
int ans = -1;
X *= 100;
rep(i, N) {
int V, P;
cin >> V >> P;
cnt += V * P;
num++;
if(cnt > X) {
ans = num;
break;
}
}
cout << ans << endl;
} |
/* Ahmed Maher ( Acro_14 )*/
/*while(WA)try();*/
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vi > vvi;
typedef vector< vd > vvd;
typedef vector<string> vs;
const ll OO = 0x3f3f3f3f;
int const N = 1e5+5;
int const mod = 1e9+7;
/*string Alphabet="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alphabet="abcdefghijklmnopqrstuvwxyz";*/
void solve(){
string s,a="atcoder";
cin>>s;
int f=-1;
for(int i=0;i<s.size();i++){
if(s[i]!='a'){
f=i;
break;
}
}
if(f==-1){
cout<<f<<endl;
}
else{
if(s>a) f=0;
if(s[f]>'t') f--;
cout<<max(f,0)<<endl;
}
}
int main(){
/*read
write*/
fastIO
ll t ;
cin>>t;
while(t--){
solve();
}
return 0;
}
// int anss[t+1];
// anss[j]=ans;
// for(int j=1;j<=t;j++) printf("Case %d: %d\n",j,anss[j]);
| #include<bits/stdc++.h>
using namespace std;
int main() {
char a, b, c;
cin >> a >> b >> c;
cout << (a == b && b == c ? "Won\n" : "Lost\n");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
ll nextLong() { ll x; scanf("%lld", &x); return x;}
int A[505][505];
int B[505][505];
const int INF = 1001001001;
int dp[505][505];
struct State {
int r, c;
int cost;
bool operator < (const State& o) const {
return cost > o.cost;
}
int &ref() {
return dp[r][c];
}
};
int main2() {
int R = nextLong();
int C = nextLong();
REP(i, R) REP(j, C-1) A[i][j] = nextLong();
REP(i, R-1) REP(j, C) B[i][j] = nextLong();
REP(i, R) REP(j, C) dp[i][j] = INF;
priority_queue<State> pq;
{
State s = {0, 0, 0};
pq.push(s);
s.ref() = 0;
}
while (!pq.empty()) {
auto cur = pq.top(); pq.pop();
if (cur.r == R - 1 && cur.c == C - 1){
break;
}
if (cur.cost != cur.ref()) continue;
if (cur.c + 1 < C) {
int nr = cur.r;
int nc = cur.c + 1;
int n_cost = cur.cost + A[cur.r][cur.c];
if (dp[nr][nc] > n_cost) {
dp[nr][nc] = n_cost;
pq.push((State){nr, nc, n_cost});
}
}
if (cur.c - 1 >= 0) {
int nr = cur.r;
int nc = cur.c - 1;
int n_cost = cur.cost + A[cur.r][cur.c - 1];
if (dp[nr][nc] > n_cost) {
dp[nr][nc] = n_cost;
pq.push((State){nr, nc, n_cost});
}
}
if (cur.r + 1 < R) {
int nr = cur.r + 1;
int nc = cur.c;
int n_cost = cur.cost + B[cur.r][cur.c];
if (dp[nr][nc] > n_cost) {
dp[nr][nc] = n_cost;
pq.push((State){nr, nc, n_cost});
}
}
for (int i = 1; i <= cur.r; i++) {
int nr = cur.r - i;
int nc = cur.c;
int n_cost = cur.cost + (1 + i);
if (dp[nr][nc] > n_cost) {
dp[nr][nc] = n_cost;
pq.push((State){nr, nc, n_cost});
}
}
}
ll ans = dp[R-1][C-1];
cout << ans << endl;
return 0;
}
int main() {
#ifdef LOCAL
for (;!cin.eof();cin>>ws)
#endif
main2();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int f(int x){
int ans=0;
while (x){
ans+=x%10;
x/=10;
}
return ans;
}
int main(){
int a,b;
cin>>a>>b;
printf("%d\n",max(f(a),f(b)));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define debug printf("%d %s\n",__LINE__,__FUNCTION__)
using ll=long long;using ld=double;using pii=pair<int,int>;using vi=vector<int>;
using qi=queue<int>;using pqi=priority_queue<int>;using si=set<int>;
#define pb push_back
#define mk make_pair
#define ins insert
#define era erase
#define fi first
#define se second
#define lowbit(x) x&-x
const int INF=0x3f3f3f3f;
const ll INFLL=0x3f3f3f3f3f3f3f3f;
const double PI=acos(-1.0);
int _w,_t;FILE* _f;
const int N=2e5+5;
int n,m,a[N],len,b[N],cnt,ans;
void solve(){
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d",&a[i]);
}
a[++m]=n+1;
sort(a+1,a+m+1);
len=INF;
for(int i=1;i<=m;i++){
if(a[i]-a[i-1]-1){
b[++cnt]=a[i]-a[i-1]-1;
len=min(len,a[i]-a[i-1]-1);
}
}
for(int i=1;i<=cnt;i++){
// printf("%d%c",b[i]," \n"[i==cnt]);
ans+=(b[i]+len-1)/len;
}
printf("%d\n",ans);
}
int main(){
#ifdef MULTI_CASES
_w=scanf("%d",&_t);while(_t--)
#endif
solve();
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<long long>a(m,0);
for(int i=0;i<a.size();i++)
cin>>a.at(i);
a.insert(a.begin(),0);
a.push_back(n+1);
sort(a.begin(),a.end());
vector<long long>len;
long long k=1000000000;
for(int i=0;i<a.size()-1;i++){
long long temp=0;
temp=a.at(i+1)-a.at(i)-1;
if(temp){
len.push_back(temp);
k=k<temp?k:temp;
}
}
long long ans=0;
for(int i=0;i<len.size();i++){
ans+=len.at(i)/k;
if(len.at(i)%k)
ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int combination(int n, int k){
vector<vector<int>> comb(n + 1, vector<int>(k + 1, 0));
for(int i = 0; i <= n; i++){
for(int j = 0; j <= k && j <= i; j++){
// printf("(i, j) = (%d, %d)\n", i, j);
if(j == 0){
comb[i][j] = 1;
}
else{
comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1];
}
// printf("comb[%d][%d] = %d\n", i, j, comb[i][j]);
}
}
return comb[n][k];
}
signed main(){
int L;
scanf("%lld", &L);
printf("%lld\n", combination(L - 1, 11));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define repl(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define mp make_pair
#define has_key(m, k) (m.find(k) != m.end())
#define INF (1e9)
#define EPS (1e-7)
// 総数を1000000007（素数）で割った余り
const ll mod = (1000000007);
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
#include <unordered_set>
#include <unordered_map>
class Radix
{
private:
unordered_map<char, ull> a;
public:
Radix(const char *s = "0123456789")
{
int i;
for (i = 0; s[i]; ++i)
a[s[i]] = i;
}
ull to(const std::string &t, ull p)
{
ull sm = a[t[0]];
const int l = (int)t.length();
for (int i = 1; i < l; ++i)
sm = sm * p + a[t[i]];
return sm;
}
};
int main()
{
std::string X;
std::cin >> X;
ull M;
cin >> M;
const ull start = (*std::max_element(X.begin(), X.end())) - '0';
ull min_n = start + 1;
ull max_n = M;
if(X.size() != 1)
max_n = max(pow(M,1.0l/(X.size()-1)),start) + 1;
Radix r;
ull ans = 0;
ull mid_n;
if (X.size() == 1)
{
if (stoull(X) <= M)
{
ans = 1;
}
}
else if (r.to(X, min_n) <= M)
{
while (max_n != min_n)
{
mid_n = (min_n + max_n) / 2;
const ull val = r.to(X, mid_n);
if (val <= M)
{
min_n = mid_n;
}
else
{
max_n = mid_n;
}
if (min_n + 1 == max_n)
{
if (r.to(X, max_n) > M)
{
max_n = min_n;
}
break;
}
}
ans = max_n - start;
}
cout << ans << endl;
return 0;
}
|
//Problem link :
//done by ankit reddy
#include<bits/stdc++.h>
using namespace std;
#define loop(i,l,h) for(int i=l;i<h;i++)
#define loopr(i,l,h) for(int i=(h);i>=(l);i--)
#define ll long long
#define ld long double
#define inf 1e9
#define mod 1000000007
#define pb push_back
#define rloop(i,l,h) for(int i=l;i>h;i--)
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define ump unordered_map
#define mp make_pair
#define pq_max priority_queue<int>
#define pq_min priority_queue<int,vector<int>,greater<int>>
#define pq_max_ll priority_queue<ll>
#define pq_min_ll priority_queue<ll,vector<ll>,greater<ll>>
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define pii pair<int,int>
#define endl "\n"
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define mid(l,r) (l+(r-l))/2
#define bitc(x) __builtin_popcount(x)
#define iter(c,it) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)
#define log(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);err(_it,args);}
#define logarr(arr,a,b) for(int z=(a);z<=(b);z++) cout<<(arr[z])<<" ";cout<<endl;
template<typename T> T gcd(T a,T b) {if(b==0) return a; return gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*(b/gcd(a,b));}
void err(istream_iterator<string> it){}
template<typename T,typename... Args>
void err(istream_iterator<string> it,T a,Args... args){
cout<<*it<<" = "<<a<<endl;
err(++it,args...);
}
void file_i_o(){
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 main(){
file_i_o();
clock_t begin=clock();
ll a,b,c;
cin>>a>>b>>c;
if(c%2==0){
if(a<0)a=a*(-1);
if(b<0)b=b*(-1);
}
if(a==b)cout<<"="<<endl;
else if(a>=0&&b>=0||c%2==0){
cout<<((a>b)?">":"<")<<endl;
}
else if(a>=0&&b<=0)cout<<">"<<endl;
else if(a<=0&&b>=0)cout<<'<'<<endl;
#ifndef ONLINE_JUDGE
clock_t end=clock();
cout<<"\n\n\nExecuted in :"<<double(end-begin)/CLOCKS_PER_SEC*1000<<" ms"<<endl;
#endif
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int a,b,c;
cin>>a>>b>>c;
int ac_minus=c%2==1&a<0;
int bc_minus=c%2==1&b<0;
if(ac_minus!=bc_minus){
if(ac_minus)
cout<<"<";
else
cout<<">";
}
else{
if(abs(a)<abs(b))
cout<<"<";
else if(abs(a)>abs(b))
cout<<">";
else
cout<<"=";
}
return 0;
} |
// ----- In the name of ALLAH, the Most Gracious, the Most Merciful -----
#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 deb(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define int long long
#define endl "\n"
#define mod 1000000007
#define inf (int)1e18
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s; cin >> s;
bool ok1=1,ok2=1;
for(int i=0;i<s.length();i++){
if((i+1)%2==1){
ok1 &= (s[i]>='a' and s[i]<='z');
}else{
ok2 &= (s[i]>='A' and s[i]<='Z');
}
}
if(ok1&&ok2) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// general template {{{
// region
typedef int int_;
#define int int64_t
#define pb push_back
#define pi pair<int,int>
#define vpi vector<pi>
#define vi vector<int>
#define vvi vector<vi>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define db double
#define sz(x) x.size()
#define watch(x) cout << #x << " : " << x << endl;
template <class A, class B> ostream& operator << (ostream& out, const pair<A, B> &a){
return out << "(" << a.first << ", " << a.second << ")";
}
template<class A>ostream& operator<<(ostream& out,const vector<A>&v) {
out << "[";
for(int i=0;i<sz(v);i++) {
if(i) out << ", ";
out << v[i];
}
return out << "]" << endl;
}
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int64_t mod = 1e9 + 7;
int Mod(int x) {
x %= mod;
if(x<0) x += mod;
return x;
}
int Pow(int x,int n) {
if(n == 0) return 1;
int t = Pow(x,n/2);
t = Mod(t*t);
if(n&1) t = Mod(t*x);
return t;
}
int gcd(int a,int b){
if(b == 0) return a;
return gcd(b,a%b);
}
// endregion
// }}}
int_ main() {
fast;
int n; cin >> n;
vvi g(n+1);
for(int i=0;i<n;i++) {
g[i].pb((2*i)%n);
g[i].pb((2*i + 1)%n);
}
for(int i=1;i<=n;i++) {
// cout << i << " : ";
for(int x:g[i-1]) cout << x+1 << " ";
cout << endl;
}
}
|
#include<cstdio>
#include<cstring>
using namespace std;
long long answer,ans=1;
long long used[20],x[101];
bool prime[101];
int n;
long long gcd(long long x,long long y)
{
if (y==0) return x;
return gcd(y,x%y);
}
void dfs(int k,long long sum)
{
if (k>used[0])
{
bool bo=false;
for (int i=1;i<=n;i++)
{
if (gcd(sum,x[i])==1)
{
bo=true;break;
}
}
if (!bo)
if (answer>sum) answer=sum;
return;
}
dfs(k+1,sum*used[k]);
dfs(k+1,sum);
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%lld",&x[i]);
long long ans=1;
memset(prime,true,sizeof(prime));
for (int i=2;i<=50;i++)
for (int j=2;j<i;j++)
if (i%j==0) prime[i]=false;
ans=1;
for (int i=1;i<=n;i++)
if (prime[x[i]]&&x[i]*2>50) ans*=x[i];
for (int i=1;i<=25;i++)
if (prime[i])
used[++used[0]]=i;
answer=3e18;
dfs(1,ans);
printf("%lld\n",answer);
} | #include<bits/stdc++.h>
#define N 500005
using namespace std;
int n,zs,zt;
char s[N],t[N];
int front[N],behind[N];
void init(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
cin>>s[i];
if(s[i]=='0')zs++;
}
for(int i=1;i<=n;i++){
cin>>t[i];
if(t[i]=='0')zt++;
}
}
int main(){
init();
if(zs!=zt)printf("-1");
else{
int ans=zs;
int nums=0,numt=0;
for(int i=1;i<=n;i++){
if(s[i]=='0')nums++;
if(t[i]=='0')numt++;
if(s[i]=='0'&&t[i]=='0'&&nums==numt){
ans--;
}
}
printf("%d",ans);
}
return 0;
} |
#include<iostream>
using namespace std;
typedef long long ll;
const ll N = 2e5+10;
ll a[N],b[N],maxn[N],c[N];
ll n;
int main(){
cin>>n;
for(ll i=1;i<=n;i++){
cin>>a[i];
}
maxn[1]=a[1];
for(ll i=2;i<=n;i++){
if(a[i]>maxn[i-1]){
maxn[i]=a[i];
}
else{
maxn[i]=maxn[i-1];
}
}
b[1]=a[1];
for(ll i=2;i<=n;i++){
b[i]=b[i-1]+a[i];
}
c[1]=b[1];
for(ll i=2;i<=n;i++){
c[i]=c[i-1]+b[i];
}
for(ll i=1;i<=n;i++){
ll ans = b[i]+c[i-1]+i*maxn[i];
cout<<ans<<endl;
}
} | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using pii = pair<ll, ll>;
using vi = vector<ll>;
template <typename T> void out(const T& t) {cout << t << '\n';}
vi vin(int n) {vi res(n); for(auto&i:res)cin>>i; return res;}
ll in() {ll x; cin>>x; return x;}
const ll MOD = 998244353;
const int N = 2e5 + 5;
ll two[N];
ll twoinv = 499122177;
ll mmod(ll x, ll y) {
if (x >= 0LL)
return x % y;
else
return (y - (-x) % y) % y;
}
void solve() {
two[0] = 1;
for (int i = 1; i < N; ++i) two[i] = 2 * two[i-1] % MOD;
ll n = in();
vi a = vin(n);
sort(all(a));
ll f = 0;
for (int i = n - 2; i >= 0; --i) f =(f+ a[i] * two[n - 2 - i]) % MOD;
ll ans = (f+a[n-1]) * a[n-1]%MOD;
for (int i = n - 2; i >= 0; --i) {
f = mmod(f-a[i], MOD);
f=f*twoinv%MOD;
ans =(ans + a[i] * f) % MOD;
ans =(ans + a[i]*a[i])%MOD;
ans = ans % MOD;
}
out(ans);
}
int main() {
ios::sync_with_stdio(false);cin.tie(0);
int t=1;;while(t--)solve();return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
long double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
long double ans = (sx * gy + sy * gx) / (sy + gy);
cout << fixed << setprecision(10) <<ans;
}
| #include <iostream>
#include <stdexcept>
#include <cassert>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
using namespace std;
int main() {
int sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
gy *= -1;
cout << setprecision(12) << - (double) (gx - sx) / (gy - sy) * sy + sx << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int M = (1e9)+7;
const int N = 400005;
const int INF = 1e12;
int a[2*N], b[2*N], sa[4*N], sb[4*N];
void change_a(int p, int value, int val_sum = 0) {
for (a[p + N] += value, sa[p += N] += val_sum; p > 1; p >>= 1) a[p>>1] = a[p] + a[p^1], sa[p>>1] = sa[p] + sa[p^1];
}
void change_b(int p, int value, int val_sum = 0) {
for (b[p + N] += value, sb[p += N] += val_sum; p > 1; p >>= 1) b[p>>1] = b[p] + b[p^1], sb[p>>1] = sb[p] + sb[p^1];
}
int query_a(int l, int r) {
int res = 0;
for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
if (l&1) res += a[l++];
if (r&1) res += a[--r];
}
return res;
}
int query_b(int l, int r) {
int res = 0;
for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
if (l&1) res += b[l++];
if (r&1) res += b[--r];
}
return res;
}
int sum_a(int l, int r) {
int res = 0;
for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
if (l&1) res += sa[l++];
if (r&1) res += sa[--r];
}
return res;
}
int sum_b(int l, int r) {
int res = 0;
for (l += N, r += N; l < r; l >>= 1, r >>= 1) {
if (l&1) res += sb[l++];
if (r&1) res += sb[--r];
}
return res;
}
signed main()
{
FAST
int tc=1;
// cin>>tc;
for(int ti=1;ti<=tc;ti++)
{
int n,m,q;
cin>>n>>m>>q;
set<int> s;
int arr[n] = {}, brr[m] = {};
int t[q], x[q], y[q];
s.insert(0);
for(int i=0;i<q;i++)
{
cin>>t[i]>>x[i]>>y[i];
x[i]--;
s.insert(y[i]);
}
map<int, int> mp;
int ind = 0;
for(int i:s) mp[i] = ind++;
change_a(0, n);
change_b(0, m);
int ans = 0;
for(int i=0;i<q;i++)
{
if(t[i] == 1)
{
ans -= sum_b(mp[arr[x[i]]]+1, N);
ans -= (query_b(0,mp[arr[x[i]]]+1)*arr[x[i]]);
change_a(mp[arr[x[i]]], -1, -arr[x[i]]);
change_a(mp[y[i]], 1, y[i]);
ans += (query_b(0,mp[y[i]]+1)*y[i]);
ans += sum_b(mp[y[i]]+1, N);
arr[x[i]] = y[i];
}
else
{
ans -= sum_a(mp[brr[x[i]]]+1, N);
ans -= (query_a(0,mp[brr[x[i]]]+1)*brr[x[i]]);
change_b(mp[brr[x[i]]], -1, -brr[x[i]]);
change_b(mp[y[i]], 1, y[i]);
ans += (query_a(0,mp[y[i]]+1)*y[i]);
ans += sum_a(mp[y[i]]+1, N);
brr[x[i]] = y[i];
}
cout<<ans<<endl;
}
}
return 0;
} | #include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
using namespace std;
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using lli = long long;
using vi = vc<int>;
using ii = pair<int,int>;
lli gcd(lli a, lli b){return (b?gcd(b,a%b):a);}
lli lcm(lli a, lli b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
int popcount(lli x) { return __builtin_popcountll(x); }
lli poww(lli a, lli b){
lli res = 1;
while(b){ if(b&1) res = res*a; a=a*a; b>>=1;}
return res;
}
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// int rnd(int n){return uniform_int_distribution<int>(0, n-1)(rng);}
template<class t,class u>bool mmax(t&a,u b){if(a<b)a=b;return a<b;}
template<class t,class u>bool mmin(t&a,u b){if(b<a)a=b;return b<a;}
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
// ---- しゃけ ツナマヨ ('-')7
typedef struct node *pn;
struct node{
array<lli,2>a;
pn l,r;
node(){a[0]=a[1]=0; l = r = 0;}
};
lli g0(pn u){
if(u)return u->a[0];
return 0;
}
lli g1(pn u){
if(u)return u->a[1];
return 0;
}
array<lli,2> SUM(array<lli,2> a, array<lli,2> b){
return {a[0]+b[0],a[1]+b[1]};
}
void upd(pn &u, int l, int r, int val, int side){
if(l>r)return;
if(l==r){
u->a[0]+=side;
u->a[1]=(u->a[0])*val;
return;
}
int mid = (l+r)/2;
if(val<=mid){
if(!u->l)u->l = new node();
upd(u->l,l,mid,val,side);
}
else{
if(!u->r)u->r = new node();
upd(u->r,mid+1,r,val,side);
}
u->a[0]=g0(u->l)+g0(u->r);
u->a[1]=g1(u->l)+g1(u->r);
}
array<lli,2> find(pn &u, int l, int r, int ll, int rr){
if(!u or l>r or l>rr or r<ll)return {0,0};
if(ll<=l and r<=rr)return {g0(u),g1(u)};
int mid = (l+r)/2;
return SUM(find(u->l,l,mid,ll,rr), find(u->r,mid+1,r,ll,rr));
}
int main(){_
auto solve=[&](){
int L = 0, R = 1e8+5;
int n,m,q; cin>>n>>m>>q;
pn A = new node(), B = new node();
upd(A,L,R,0,n);
upd(B,L,R,0,m);
vi aa(n,0), bb(m,0);
lli sum = 0;
auto g=[&](pn &a, pn &b, int &x, int y){
auto tot = find(a,L,R,L,R);
auto aux = find(a,L,R,L,x);
sum-= (tot[1]-aux[1])+aux[0]*x;
upd(b,L,R,x,-1);
x = y;
upd(b,L,R,x,+1);
aux = find(a,L,R,L,x);
sum+=(tot[1]-aux[1])+aux[0]*x;
};
fore(i,0,q){
int t,x,y; cin>>t>>x>>y; x--;
if(t==2)g(A,B,bb[x],y);
else g(B,A,aa[x],y);
cout<<sum<<ENDL;
}
};
//int t; cin>>t; while(t--)
solve();
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_backk
#define pp pair
int main()
{
int tt;
tt=1;
while(tt--)
{
ll n;
cin>>n;
ll ans=0,spit=n+1;
ll kk=1;
while(spit>=kk)
{
ans++;
spit-=kk;
kk+=1;
}
cout<<n-ans+1<<endl;
}
return 0;
} | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>
using namespace std;
template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
out << "["; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
out << "{"; bool first = true;
for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
int main() {
int64 n;
cin >> n;
__int128 sum = (__int128)n * (n + 1) / 2;
__int128 low = 0, high = n;
while (low != high) {
__int128 mid = (low + high) / 2;
__int128 cur = (n + 1 + n + 1 - mid + 1) * mid / 2;
if (cur < sum) {
low = mid + 1;
} else {
high = mid;
}
}
cout << (int64)high << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) ;for (int i=0; i<(n); i++)
// #include <atcoder/all>
#include <random>
using namespace std;
// using namespace atcoder;
using ll = long long;
using P = pair<int, int>;
const ll MOD = 1000000007;
const int INF = 1e9;
// using Graph = vector<vector<int>>;
/* divisor(n)
入力：整数 n
出力：nのすべての約数
計算量：O(√n)
*/
vector<long long> divisor(long long 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;
}
int main(){
int n;
cin >> n;
vector<int> x(n);
vector<int> y(n);
vector<pair<int,int>> r(n);
vector<int> ansa(n);
vector<int> ansb(n);
vector<int> ansc(n);
vector<int> ansd(n);
vector<int> fansa(n);
vector<int> fansb(n);
vector<int> fansc(n);
vector<int> fansd(n);
rep(i,n){
cin >> x[i] >> y[i] >> r[i].first;
r[i].second = i;
}
vector<vector<int>> distx(n, vector<int> (n));
vector<vector<int>> disty(n, vector<int> (n));
vector<int> midistu(n,INF);
vector<int> midistd(n,INF);
vector<int> midistl(n,INF);
vector<int> midistr(n,INF);
rep(i,n){
rep(j,n){
distx[i][j] = x[i]-x[j];
disty[i][j] = y[i]-y[j];
if(distx[i][j]>0) midistl[i] = min(midistl[i],distx[i][j]);
else midistr[i] = min(midistr[i],(-1*distx[i][j]));
if(disty[i][j]>0) midistd[i] = min(midistd[i],disty[i][j]);
else midistu[i] = min(midistu[i],(-1*disty[i][j]));
}
}
rep(i,n){
int a = x[i]-midistl[i];
int b = y[i]-midistd[i];
int c = x[i]+midistr[i];
int d = y[i]+midistu[i];
a = max(0,a);
b = max(0,b);
c = min(10000,c);
d = min(10000,d);
cout << a << " " << b << " " << c << " " << d << endl;
}
}
| #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))
#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))
#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
template<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}
template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}
template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}
template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}
template<class T=ll> T read(){ T re; cin>>re; return move(re);}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}
vv<int> readG(const int &n){ return readG(n,n-1);}
#define TT cauto TTT=read();rep(_,TTT)
const ll MOD=1e9+7; //998244353;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cout<<fixed<<setprecision(0);
auto s=read<string>();
cauto t=read();
rep(_,t){
auto a=s,b=s;
sort(rall(a));
sort(all(b));
s=to_string(stoi(a)-stoi(b));
out(s,a,b,1);
}
cout<<s NL;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> pos(n);
for (auto &&[x, y] : pos) {
cin >> x >> y;
}
auto judge = [&](double r) -> bool {
queue<int> q;
for (auto i = 0; i != n; ++i) {
if (100 - r < pos[i].second + r) {
q.push(i);
}
}
vector<bool> used(n);
while (!q.empty()) {
auto id = q.front();
q.pop();
if (used[id]) continue;
used[id] = true;
for (auto i = 0; i != n; ++i) {
if (hypot(pos[i].first - pos[id].first,
pos[i].second - pos[id].second) < 2 * r) {
q.push(i);
}
}
}
for (auto i = 0; i != n; ++i) {
if (used[i]) {
if (r - 100 > pos[i].second - r) {
return false;
}
}
}
return true;
};
constexpr double eps = 1e-4;
double ok = 0, ng = 100;
while (ng - ok > eps) {
auto r = (ok + ng) / 2;
if (judge(r))
ok = r;
else
ng = r;
}
cout << ok << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<typename T> bool chmin(T &a, T b) {if(a>b){a=b; return 1; } return 0; }
int h, w;
#ifndef dijkstra_hpp
#define dijkstra_hpp
#include<vector>
#include<queue>
#include<utility>
struct Dijkstra {
// Edge: 辺の情報の構造体
private:
const long long MAX_DIST = 1e18;
struct Edge {int to; long long cost; };
int n;
std::vector<std::vector<Edge>> es;
std::vector<long long> dist;
public:
Dijkstra(int _n): n(_n), es(_n), dist(_n){}
void add_edge(int from, int to, long long cost) {
es[from].push_back(Edge{to, cost});
}
void solve(int s) {
for (int i = 0; i < n; ++i) dist[i] = MAX_DIST;
dist[s] = 0;
std::priority_queue<std::pair<long long,int>, std::vector<std::pair<long long,int>>, std::greater<std::pair<long long,int>>> q;
q.push({0, s});
while (!q.empty()) {
auto p = q.top(); q.pop();
int v = p.second;
if (dist[v] < p.first) continue;
if (v >= w) {
for (int i = 1; i <= v/w; ++i) {
int to = v - i*w;
if (chmin(dist[to], dist[v] + i+1)) {
q.push({dist[to], to});
}
}
}
for (Edge e: es[v]) {
if (dist[e.to] > p.first + e.cost) {
dist[e.to] = p.first + e.cost;
q.push({dist[e.to], e.to});
}
}
}
}
long long get_dist(int t) {
return dist[t];
}
};
#endif // dijkstra_hpp
int main() {
cin >> h >> w;
Dijkstra g(h*w);
vector<vector<int>> a(h, vector<int>(w));
rep(i,h) {
rep(j,w-1) {
cin >> a[i][j];
}
}
rep(i,h) {
rep(j,w) {
int now = i*w+j;
if (0 < j) g.add_edge(now, now-1, a[i][j-1]);
if (j < w-1) g.add_edge(now, now+1, a[i][j]);
}
}
int b;
rep(i,h-1) {
rep(j,w) {
cin >> b;
int now = i*w+j;
g.add_edge(now, now+w, b);
}
}
g.solve(0);
cout << g.get_dist(h*w-1) << endl;
} |
#line 1 "main_c.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <chrono>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#include <utility>
#include <limits>
#include <list>
#include <type_traits>
/* template start */
using i64=std::int_fast64_t;
using u64=std::uint_fast64_t;
#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()
#ifdef LOCAL
#define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
void debug_out(){std::cerr<<std::endl;}
template<typename Head,typename... Tail>
void debug_out(Head h,Tail... t){
std::cerr<<" "<<h;
if(sizeof...(t)>0)std::cout<<" :";
debug_out(t...);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
template<typename Num>
constexpr Num mypow(Num a, u64 b,Num id=1) {
if(b==0)return id;
Num x = id;
while (b > 0) {
if(b & 1)x*=a;
a*=a;
b >>= 1;
}
return x;
}
/* template end */
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
i64 n;
std::cin>>n;
std::vector<i64> pe(2*n,-1);
std::vector<bool> dp(n+1,false);
dp[0]=true;
rep(i,0,n){
i64 a,b;
std::cin>>a>>b;
if(a!=-1){
a--;
if(pe[a]!=-1){
std::cout<<"No\n";
return 0;
}
pe[a]=i;
}
if(b!=-1){
b--;
if(pe[b]!=-1){
std::cout<<"No\n";
return 0;
}
pe[b]=i+n;
}
}
rep(i,1,n+1){
rep(j,0,i){
i64 len=i-j;
bool val=dp[j];
rep(k,2*j,2*j+len){
if(pe[k]==-1){
if(pe[k+len]!=-1&&pe[k+len]<n)val=false;
}else{
if(pe[k] >=n) val=false;
if((pe[k+len]!=-1)&&(pe[k+len]!=pe[k]+n))val=false;
}
}
if(val)dp[i]=true;
}
}
debug(pe);
debug(dp);
if(dp[n])std::cout<<"Yes\n";
else std::cout<<"No\n";
return 0;
}
| #include <bits/stdc++.h>
// #include<iomanip>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;
#define f(i,a,b) for(ll i=a;i<b;i++)
#define fo(i,a,b) for(ll i = a; i<=b;i+=1)
// #define Vector vector
#define rf(i,a,b) for(ll i=a;i>=b;i--)
#define vll vector<ll>
#define sz(a) ll(a.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define MAXN 100010
#define MOD 1000000007
#define mod 998244353
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define debug(x) cout << '>' << #x << ':' << x << " ";
#define nl '\n'
#define MS(x,y) fill_n(*x, sizeof x / sizeof **x, y);
#define mem(x,y) memset(x,y,sizeof(x));
#define INF 1000000000000000000
#define int long long int
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
void solve(){
int n;
cin >> n;
vll a(n);
f(i, 0, n){
cin >> a[i];
}
sort(all(a));
int aage = n-1;
int sum = 0;
f(i, 0, n){
int piche = n - aage - 1;
sum += piche*a[i]-aage*a[i];
aage--;
}
cout << sum << nl;
return ;
}
main()
{
IO;
int T = 1;
// cin >> T;
for(int c=1; c <= T; c++){
solve();
// cout<<"Case #"<<c<<": ";
}
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int t[10][10],a[12];
int n,k,ans;
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>t[i][j];
for(int i=1;i<=n;i++) a[i]=i;
do{
int sum=0;
for(int i=2;i<=n;i++)
{
sum+=t[a[i-1]][a[i]];
}
sum+=t[a[n]][1];
if(sum==k)
ans++;
}while(next_permutation(a+2,a+n+1));
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
int a[10];
int main()
{
int sum=0;
for(int i=1;i<=4;i++) sum+=(a[i]=read());
if(sum&1) puts("No");
else
{
for(int i=1;i<4;i++)
if(a[i]==sum-a[i])
{
puts("Yes");
return 0;
}
for(int i=1;i<4;i++)
for(int j=i+1;j<=4;j++)
if(a[i]+a[j]==sum-a[i]-a[j])
{
puts("Yes");
return 0;
}
puts("No");
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n;
struct CH
{
string s;
int v;
}Ty[1010];
bool cmp(CH x,CH y)
{
return x.v>y.v;
}
template<typename Tp>
void read(Tp &x)
{
x=0;int f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}x*=f;
}
int main()
{
read(n);
for(int i=1;i<=n;i++)
{
cin>>Ty[i].s;
read(Ty[i].v);
}
sort(Ty+1,Ty+n+1,cmp);
cout<<Ty[2].s<<endl;
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
// Hi
int main(){
ios::sync_with_stdio(0);cin.tie(0);
string n;int k;
cin>>n>>k;
for(int i=0;i<k;i++){
string a = n;
sort(a.begin(),a.end());
int an = 0,bn = 0;
for(int i=0;i<(int)(a.size());i++){
an = (an*10)+(a[i]-'0');
}
for(int i=(int)a.size()-1;i>=0;i--){
bn = (bn*10)+(a[i]-'0');
}
n = to_string((bn-an));
}
cout << n << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define int long long
const int inf = 100100100100100100;
const int maxn = 17;
int n, m;
int dist[maxn][maxn];
int dp[1<<maxn][maxn];
int dfs(int s, int v){
if(dp[s][v] >= 0){
return dp[s][v];
}
if(s == (1<<n)-1 && v == 0){
return dp[s][v] = 0;
}
int ans = inf;
rep(u,0,n){
if(!(s >> u & 1)){
ans = min(ans, dfs(s | 1 << u, u) + dist[v][u]);
}
}
dp[s][v] = ans;
return ans;
}
signed main(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> n;
memset(dp,-1,sizeof(dp));
fill(dist[0],dist[0]+maxn*maxn,inf);
vector<vector<int>> vec(n,vector<int>(3));
for(int i=0;i<n;i++){
cin>>vec[i][0]>>vec[i][1]>>vec[i][2];
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(i==j)dist[i][j]=inf;
else{
int tmp;
if((0>vec[j][2]-vec[i][2]))tmp=0;
else tmp=vec[j][2]-vec[i][2];
dist[i][j]=abs(vec[j][0]-vec[i][0])+abs(vec[j][1]-vec[i][1])+tmp;
}
}
}
int ans = dfs(0,0);
cout << (ans == inf ? -1 : ans) << endl;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define show(x) cout << #x << " = " << x << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo {cout<<"Yes";}else{cout<<"No";}
#define YESNO {cout<<"YES";}else{cout<<"NO";}
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const pair<T, T>& v) {
o << "(" << v.first << "," << v.second << ")";
return o;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T> ostream& operator<<(ostream& o, const set<T>& v) {
for (auto e : v) {
o << e << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
#if 1
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
vl as, bs;
for (ll i = 1; i < 1e18; i *= 3) {
as.push_back(i);
}
for (ll i = 1; i < 1e18; i *= 5) {
bs.push_back(i);
}
ll N; cin >> N;
FOR(i, 1, sz(as)) {
ll b = N - as[i];
auto bp = lower_bound(rng(bs), b);
if (*bp==b && bp != bs.begin()) {
cout << i << ' ' << (bp - bs.begin()) << newl;
return 0;
}
}
cout << -1;
}
#endif
|
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define 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())
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
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(){
ll a,b,c;
cin>>a>>b>>c;
if(c%2==0){
if(abs(a)==abs(b))cout << "=" << endl;
if(abs(a)<abs(b))cout << "<" << endl;
if(abs(a)>abs(b))cout << ">" << endl;
}
if(c%2==1){
if(a==b)cout << "=" << endl;
if(a<b)cout << "<" << endl;
if(a>b)cout << ">" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N = 3;
int X[N];
for(int i=0; i<N; i++) cin>>X[i];
int A, B, C;
A = X[0];
B = X[1];
C = X[2];
if ( !(C%2) ) {
if (abs(A)==abs(B)){
cout << "=" << endl;
} else if (abs(A)<abs(B)){
cout << "<" << endl;
} else if(abs(A)>abs(B)){
cout << ">" << endl;
} else {
cout << "=" << endl;
}
} else {
if ( ((A<0)&&(B<0)) || ((A>0)&&(B>0)) ){
if ( A<B ){
cout << "<" << endl;
} else if (A>B){
cout << ">" << endl;
} else {
cout << "=" << endl;
}
} else if ( (A<0)&&(B>0) ) {
cout << "<" << endl;
} else if ( (A>0)&&(B<0) ) {
cout << ">" << endl;
} else if ( (A==0)&&(B<0) ) {
cout << ">" << endl;
} else if ( (A==0)&&(B>0) ) {
cout << "<" << endl;
} else if ( (A<0)&&(B==0) ) {
cout << "<" << endl;
} else if ( (A>0)&&(B==0) ) {
cout << ">" << endl;
} else if ( (A==0)&&(B==0) ){
cout << "=" << endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int n,x;
cin >> n >> x;
int a[n],b[n];
for(int i=0;i<n;i++){
cin >> a[i] >> b[i];
}
int count=0;
for(int i=0;i<n;i++){
count=count+a[i]*b[i];
if(count>100*x){
cout << i+1 << endl;
break;
}
if((i==n-1)&&(count<=100*x)){
cout << -1 << endl;
}
}
} | /*********************************************************************************\
* _________ _ _ ________ _ _ __ ________ *
* |___ ___|| | | || ______|| | | | / \ | ____ | *
* | | | | | || |______ | |_____| | / /\ \ | |____| | *
* | | | | | ||______ || _____ | / /__\ \ | __ __| *
* | | | |____| | ______| || | | | / ______ \ | | \ \ *
* |_| |________||________||_| |_| /_/ \_\ |_| \_\ *
* *
* Department of Computer Science & Engineering *
* Student ID : 18CSE035 *
* Bangabnadhu Sheikh Mujibur Rahman Science & Technology University,Gopalgonj. *
* *
\*********************************************************************************/
//Now Write to Code ___________________________
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
inline int Int(){int x; cin >> x; return x;}
inline ll Long(){ll x; cin >> x; return x;}
inline float Float(){float x; cin >> x; return x;}
inline double Double(){double x; cin >> x; return x;}
inline void Yes(){cout << "Yes" << endl;}
inline void No(){cout << "No" << endl;}
inline void YES(){cout << "YES" << endl;}
inline void NO(){cout << "NO" << endl;}
const int N =(int)2e5 + 5;
const int maxN =(int)1e6 + 6;
const ll Mod =(ll)1e9 + 7;
const int inf =(int)2e9;
const ll Inf =(ll)1e18;
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL)
#define T int t,q; cin >> t; for(q=1;q<=t;q++)
#define Forn(i,n) for(int i=0;i<n;i++)
#define ForN(i,n) int i;for(i=n-1;n>=0;i--)
#define forn(i,n) for(int i=1;i<=n;i++)
#define forN(i,n) int i;for(i=n;n>=1;i--)
#define fors(i,s) for(int i=0;i<s.size();i++)
#define Sort(s) sort(s.begin(),s.end())
#define debug(x) cerr << #x << " = " << x << '\n' ;
#define rep(i,b,e) for(__typeof(e) i=(b); i!=(e+1)-2*(b>e); i=i+1-2*(b>e))
#define gcd(a,b) __gcd(a , b)
#define lcm(a,b) (a*(b/__gcd(a,b)))
#define gt greater<int>()
#define Int Int()
#define Long Long()
#define Float Float()
#define Double Double()
#define all(x) x.begin() , x.end()
#define sz(x) (int)x.size()
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mem(a) memset(a,0,sizeof a)
#define memn(a) memset(a,-1,sizeof a)
#define biday return 0
#define nl endl
#define sp(n) fixed<<setprecision(n)
#define pi acos(-1)
#define PI 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342
int main()
{
int n,x,i;
double sum=0;
cin >> n >> x;
int v[n],p[n];
x*=100;
for(i=0; i<n; i++)cin >> v[i] >> p[i];
for(i=0; i<n; i++)
{
sum+=((double)v[i]*(double)p[i]);
if(sum>x)
{
cout << i+1 << endl;
break;
}
}
if(sum<=x)cout << -1 << endl;
biday;
}
//...............BYE BYE................ |
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b;cin>>a>>b;if(a==b)cout<<a<<endl;else cout<<3-a-b<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M 1000000007
#define pb push_back
#define bg begin
#define pob pop_back
#define rep(x,y,j) for(ll j = x;j < y ;j++)
#define sz size
#define ss second
#define ff first
#define SUM accumulate
#define INF 2000000000000000000
#define SPACE " "
#define vr std::vector
#define que queue
#define dqu deque
#define stk stack
#define pqu priority_queue
#define mst multiset
#define pf push_front
#define pof pop_front
#define sqr(x) ((x)*(x))
#define cube(x) (x)*sqr(x)
void solve(){
// std::cout << std::setprecision(9) << std::showpoint << std::fixed;
ll x,y;
cin >> x >> y;
set <ll> s{0,1,2};
if (x == y )
{
cout << x << endl;
/* code */
}
else
{
s.erase(x);
s.erase(y);
cout << *(s.bg())<<endl;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int tt= 1;
// cin >> tt;
while (tt--) {
solve();
}
return 0;
} |
#pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
constexpr char newl = '\n';
constexpr double eps = 1e-10;
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define F0R(i,b) FOR(i,0,b)
#define RFO(i,a,b) for (int i = ((b)-1); i >=(a); i--)
#define RF0(i,b) RFO(i,0,b)
#define show(x) cerr << #x << " = " << (x) << '\n';
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define YesNo(x) cout<<((x)?"Yes":"No")<<newl;
#define YESNO(x) cout<<((x)?"YES":"NO")<<newl;
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
template<class A, class B> using umap = unordered_map<A, B>;
template<class A> using uset = unordered_set<A>;
template<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
template<class T> bool lcmp(const pair<T, T>& l, const pair<T, T>& r) {
return l.first < r.first;
}
template<class T> istream& operator>>(istream& i, v(T)& v) {
F0R(j, sz(v)) i >> v[j];
return i;
}
template<class A, class B> istream& operator>>(istream& i, pair<A, B>& p) {
return i >> p.first >> p.second;
}
template<class A, class B, class C> istream& operator>>(istream& i, tuple<A, B, C>& t) {
return i >> get<0>(t) >> get<1>(t) >> get<2>(t);
}
template<class T> ostream& operator<<(ostream& o, const pair<T, T>& v) {
o << "(" << v.first << "," << v.second << ")";
return o;
}
template<class T> ostream& operator<<(ostream& o, const vector<T>& v) {
F0R(i, v.size()) {
o << v[i] << ' ';
}
o << newl;
return o;
}
template<class T> ostream& operator<<(ostream& o, const set<T>& v) {
for (auto e : v) {
o << e << ' ';
}
o << newl;
return o;
}
template<class T1, class T2> ostream& operator<<(ostream& o, const map<T1, T2>& m) {
for (auto& p : m) {
o << p.first << ": " << p.second << newl;
}
o << newl;
return o;
}
// INSERT ABOVE HERE
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int N; ll K;
cin >> N >> K;
using E = pair<ll, int>;
v(E) es(N);
F0R(i, N) {
ll a; int b; cin >> a >> b;
es[i] = { a,b };
}
sort(rng(es));
F0R(i, N) {
auto [a, b] = es[i];
if (a > K) break;
K += b;
}
cout << K << newl;
}
#endif
| //by ciwomuli
//enter ICPC WF 2020
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define LL long long
using namespace std;
template <typename T>
inline void read(T &t)
{
int f = 0, c = getchar();
t = 0;
while (!isdigit(c))
f |= c == '-', c = getchar();
while (isdigit(c))
t = t * 10 + c - 48, c = getchar();
if (f)
t = -t;
}
template <typename T, typename... Args>
inline void read(T &t, Args &... args)
{
read(t);
read(args...);
}
int main()
{
int n, x;
read(n, x);
x *= 100;
double sum = 0;
for (int i = 1; i <= n; i++)
{
int a, b;
read(a, b);
sum += a * b;
if (sum > x)
{
cout << i;
return 0;
}
}
cout << -1;
} |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define PI 3.14159265359
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pai;
typedef pair<ll, ll> pal;
const int INF = 1e9+7;
const int MOD = 1e9+7;
const int MODD = 998244353;
const ll LLINF = 1e18;
#define LOOP(n) for (int _i = 0; _i < (n); _i++)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, r, n) for (int i = (r); i < (n); ++i)
#define ALL(obj) begin(obj), end(obj)
template <class T>
bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int V;
int G[20][20]; // グラフ
int dp[200000][20];
// メモ化再帰
int rec(int S, int v) {
if (S == 0) {
if (v == 0) {
return 0;
} else {
return INF;
}
}
if ((S & (1 << v)) == 0) { // Sに{v}が含まれていない
return INF;
}
int &ret = dp[S][v];
if (ret != 0) return ret;
ret = INF;
REP(u, V) { chmin(ret, rec(S ^ (1 << v), u) + G[u][v]); }
return ret;
}
int main() {
cin >> V;
// グラフの初期化
REP(i, 20) {
REP(j, 20) { G[i][j] = INF; }
}
int x[20], y[20], z[20];
for (int i = 0; i < V; i++){
cin >> x[i] >> y[i] >> z[i];
}
for (int i = 0; i < V; i++){
for (int j = 0; j < V; j++){
G[i][j] = abs(x[j] - x[i]) + abs(y[j] - y[i]) + max(0, z[j] - z[i]);
}
}
int ans = rec((1 << V) - 1, 0);
if (ans != INF) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define N 100005
#define MOD 1000000007
#define dd double
#define vi vector<int>
#define vll vector<ll>
#define forr(i,n) for(ll i=0;i<n;i++)
#define revf(i,n) for(ll i=n-1;i>=0;i--)
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define rep1(i,b) for(ll i=1;i<=b;i++)
#define inp(a,n) for(ll i=0;i<n;i++)cin>>a[i]
#define outp(a,n) for(ll i=0;i<n;i++)cout<<a[i]<<" "
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) (((a)*(b))/gcd((a),(b)))
#define pb push_back
#define mp make_pair
#define BINSC binary_search
#define BITOUT __builtin_popcount
#define mem(x,n) memset(x,n,sizeof(x))
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define test ll t; cin>>t; while(t--)
#define cn cout<<"\n";
int main()
{
fast
ll x,y,z;
cin>>x>>y>>z;
double a=(dd)y/x;
dd b=a*z;
if(floor(b)==ceil(b))
cout<<b-1;
else
cout<<floor(b);
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,c;
cin>>a>>b>>c;
vector<long long>vec;
vec.push_back(a);vec.push_back(c);vec.push_back(b);
sort(vec.begin(),vec.end());
if(vec[1]-vec[0]==vec[2]-vec[1])
{
cout<<"Yes"<<endl;
}
else
{
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
return ((a > b) ? (a = b, true) : (false));
}
int main(){
vl v(3);rep(i,3)cin >> v[i];
sort(all(v));
if(v[2]-v[1]==v[1]-v[0])cout << "Yes" <<endl;
else cout << "No" <<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// UnionFind
class UnionFind{
vector<int> d;
int m;
public:
UnionFind(int n = 0):d(n,-1),m(1){}
~UnionFind(){}
int find(int x){
if(d[x] < 0) return x;
return d[x] = find(d[x]);
}
bool unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return false; // 既にxとyは繋がっている。
if(d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
m = (m < -d[x] ? -d[x] : m);
return true;
}
bool same(int x, int y) { return find(x) == find(y);}
int size(int x) { return -d[find(x)];}
int sizeMax() { return m;}
};
int main() {
int N, M;
cin >> N >> M;
vector<ll> a(N,0);
vector<ll> b(N,0);
for(int i = 0; i < N; i++){
cin >> a[i];
}
for(int i = 0; i < N; i++){
cin >> b[i];
}
UnionFind U(N);
for(int i = 0; i < M; i++){
int c,d;
cin >> c >> d;
c--;
d--;
U.unite(c,d);
}
map<int,ll> P;
map<int,ll> Q;
for(int i = 0; i < N; i++){
int f = U.find(i);
P[f] += a[i];
Q[f] += b[i];
}
int f = 0;
for(auto it = P.begin(); it != P.end(); it++){
if(P[it->first] != Q[it->first]){
cout << "No" << endl;
return(0);
}
}
cout << "Yes" << endl;
return(0);
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define fast \
cin.tie(0); \
ios::sync_with_stdio(false);
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, int>;
struct UnionFind {
vector<int> rank, par;
UnionFind() {}
UnionFind(int n) {
rank.resize(n, 0);
par.resize(n, 0);
for (int i = 0; i < n; i++) {
makeTree(i);
}
}
void makeTree(int x) {
par[x] = x;
rank[x] = 0;
}
bool isSame(int x, int y) { return findRoot(x) == findRoot(y); }
bool unite(int x, int y) {
x = findRoot(x);
y = findRoot(y);
if (x == y) return false;
if (rank[x] > rank[y]) {
par[y] = x;
} else {
par[x] = y;
if (rank[x] == rank[y]) {
rank[y]++;
}
}
return true;
}
int findRoot(int x) {
if (x != par[x]) {
par[x] = findRoot(par[x]);
}
return par[x];
}
};
int main() {
int n, m;
cin >> n >> m;
vl a(n), b(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) cin >> b[i];
UnionFind s(n);
rep(i, 0, m) {
int a, b;
cin >> a >> b;
s.unite(a - 1, b - 1);
}
map<int, vi> g;
rep(i, 0, n) g[s.findRoot(i)].pb(i);
for(auto i:g){
ll cnt = 0;
ll cnt2 = 0;
for(auto j:i.se){
cnt += a[j];
cnt2 += b[j];
}
if(cnt != cnt2){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=2e5;
const int inf=1e9;
vector<pair<int,long>> g[siz];
long dist[siz];
void dfs(int v, int par, long d){
dist[v] = d;
for(pair<int,long> p:g[v]){
int u = p.first;
long w = p.second;
if(u == par) continue;
dfs(u, v, d ^ w);
}
}
long calc(long x, int j){
rep(i,0,j) (x *= 2) %= mod;
return x;
}
int main(){
int N; cin>>N;
int a,b; long c;
rep(i,0,N-1){
cin>>a>>b>>c; a--; b--;
g[a].push_back({b, c});
g[b].push_back({a, c});
}
dfs(0, -1, 0);
long cnt[60] = {};
rep(i,0,N)rep(j,0,60){
if(dist[i] & (1L<<j)) cnt[j]++;
}
long ans = 0;
rep(j,0,60) (ans += calc(cnt[j] * (N-cnt[j]) % mod, j)) %= mod;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using ii = pair<int, lli>;
const int MAXN = 2e5;
const lli MOD = 1e9+7;
int n;
vector<ii> adj[MAXN+1];
lli rootXor[MAXN+1];
void dfs(int u, int p, lli x) {
rootXor[u] = x;
for(ii v: adj[u]) {
if(v.first == p) {
continue;
}
dfs(v.first, u, x ^ v.second);
}
}
lli safeMult(lli a, lli b) {
if(!b) {
return 0;
}
if(b%2) {
return (safeMult(a, b-1) + a) % MOD;
}
else {
lli aux = safeMult(a, b/2);
return (aux + aux) % MOD;
}
}
int main() {
scanf("%d", &n);
for(int i=0; i<n-1; i++) {
int u, v;
lli w;
scanf("%d %d %lld", &u, &v, &w);
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
dfs(1, 1, 0);
vector<lli> ones(60, 0);
lli ans = 0;
for(int i=1; i<=n; i++) {
lli cand = 0;
for(int j=0; j<60; j++) {
lli zeroes = (i-1)-ones[j];
if(rootXor[i]&(lli(1) << j)) {
cand += safeMult(lli(1) << j, zeroes);
}
else {
cand += safeMult(lli(1) << j, ones[j]);
}
cand = cand % MOD;
}
ans = (ans + cand) % MOD;
for(int j=0; j<60; j++) {
if(rootXor[i]&(lli(1) << j)) {
ones[j]++;
}
}
}
printf("%lld\n", ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2e5 + 5;
vector<int> adj[maxn];
int x, y;
int a[maxn], b[maxn];
bool visited[maxn];
void dfs(int src)
{
visited[src] = true;
x += a[src];
y += b[src];
for (auto node : adj[src])
{
if (!visited[node])
{
dfs(node);
}
}
}
int32_t main()
{
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> b[i];
for (int i = 0, u, v; i < m; i++)
{
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
bool ispossible = true;
for (int i = 1; i <= n; i++)
{
if (!visited[i])
{
x = y = 0;
dfs(i);
if (x != y)
{
ispossible = false;
break;
}
}
}
if (ispossible)
cout << "Yes" << "\n";
else
cout << "No" << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
#define setp(x) fixed << setprecision(x)
#define ordered_set tree<pair<long double, int> , null_type,less<pair<long double, int> >, rb_tree_tag,tree_order_statistics_node_update>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int inf = int(1e9);
const ll INF = ll(1e16);
const int mod = inf + 7;
const double PI = acos(-1.0);
void mul(ll &x, ll y){
x *= y;
if(x >= mod) x %= mod;
}
ll bp(ll a, ll n, ll cm){
ll r = 1;
while(n){
if(n & 1) r = r * a % cm;
a = a * a % cm;
n >>= 1;
}
return r;
}
template<typename T_vector> // neal
void output_vector(const T_vector &v, bool add_one = false, int start = -1, int end = -1) {
if (start < 0) start = 0;
if (end < 0) end = int(v.size());
for (int i = start; i < end; i++)
cout << v[i] + (add_one ? 1 : 0) << (i < end - 1 ? ' ' : '\n');
}
const int N = 200200;
int a[N], b[N], used[N];
vector<int> g[N];
vector<int> id, val;
ll s1, s2;
void dfs(int v){
used[v] = 1;
s1 += a[v];
s2 += b[v];
for(int to : g[v]){
if(!used[to]){
dfs(to);
}
}
}
void solve(){
int n, m;
cin >> n >> m;
rep(i, n){
cin >> a[i];
}
rep(i, n){
cin >> b[i];
}
rep(i, m){
int x, y;
cin >> x >> y;
--x, --y;
g[x].pb(y);
g[y].pb(x);
}
bool bad = 0;
rep(i, n){
if(!used[i]){
s1 = 0, s2 = 0;
dfs(i);
bad |= (s1 != s2);
}
}
cout << (bad ? "No" : "Yes");
}
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
Red;
int T = 1;
// cin >> T;
for(int i = 1; i <= T; ++i){
solve();
}
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
ll N; cin >> N;
vector<vector<ll>> p(N, vector<ll> (5));
rep(i,N)rep(j,5) cin >> p[i][j];
vector<vector<pair<ll,ll>>> x(5, vector<pair<ll,ll>> (N));
rep(j,5)rep(i,N) x[j][i] ={p[i][j], i};
rep(j,5) sort(x[j].begin(), x[j].end());
if(N <= 10){
ll ans = 0;
rep(i,N)rep(j,i)rep(k,j){
ll cnt = 1e18;
rep(r,5){
cnt = min(cnt, max({p[i][r], p[j][r], p[k][r]}));
}
ans = max(ans, cnt);
}
cout << ans << endl;
return 0;
}
ll ans = 0;
rep(i,N)rep(j,i){
auto p1 = p[i];
auto p2 = p[j];
ll mi = 1e18, id = 0;
rep(k,5){
if(mi > max(p1[k], p2[k])){
mi = max(p1[k], p2[k]);
id = k;
}
}
ll it = x[id][N - 1].second;
if(it == i || it == j) it = x[id][N - 2].second;
if(it == i || it == j) it = x[id][N - 3].second;
auto p3 = p[it];
ll cnt = 1e18;
rep(k,5){
cnt = min(cnt, max({p1[k], p2[k], p3[k]}));
}
ans = max(ans, cnt);
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
int main(){
ll N; cin >> N;
vector<int> op;
ll x=0,y=0;
vector<ll> fib={1,1};
for(int i=2;;i++){
if(fib[i-1]+fib[i-2]>1e18) break;
fib.pb(fib[i-1]+fib[i-2]);
}
int sf = sz(fib);
int S=sf-1;
int t = 0;
while(1){
if(x+fib[S-t]<=N){
op.pb(1);
N-=fib[S-t];
}
op.pb(4);
t++;
if(x+fib[S-t]<=N){
N-=fib[S-t];
op.pb(2);
}
op.pb(3);
t++;
if(t>=S) break;
}
cout << sz(op) << endl;
rep(i,sz(op)) cout << op[i] << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n;
ll a[100005];
vector<ll> ve[100005], now;
ll d[100005];
bool v[100005];
int main()
{
scanf("%lld", &n);
for(ll i = 2; i <= n; i++)
{
scanf("%lld", &a[i]);
ve[a[i]].push_back(i);
}
for(ll i = n; i >= 1; i--)
{
ll t = 0;
now.clear();
d[i]--;
for(ll j = 0; j < ve[i].size(); j++)
{
ll jj = ve[i][j];
if(v[jj]) now.push_back(d[jj]);
else if(d[jj] > 0) d[i] += d[jj];
else t += d[jj];
}
if((ll)now.size() % 2 == 1) d[i] -= t, v[i] = false;
else d[i] += t, v[i] = true;
sort(now.begin(), now.end(), greater<int>());
for(ll j = 0; j < (ll)now.size() - 1; j += 2) d[i] += now[j] - now[j + 1];
if((ll)now.size() % 2 == 1) d[i] += now[now.size() - 1];
}
printf("%lld\n", (n - d[1]) / 2);
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define vll vector<ll>
#define vvl vector<vll>
#define pii pair<ll,ll>
#define F first
#define S second
#define M 1000000007
ll max(ll a,ll b){if (a>b) return a; else return b;}
ll min(ll a,ll b){if(a<b) return a; return b;}
ll mod=998244353;
ll po(ll x, ll y){
if(y==0)
return 1;
if(y%2){
return ((x)*(po(x,y/2)%M)*(po(x,y/2)%M) + M)%M;
}
return ((po(x,y/2)%M)*(po(x,y/2)%M) + M)%M;
}
void seive(bool prime[]){
//bool prime[100002];
for (ll p=2; p*p<=1000001; p++)
{
if (prime[p])
{
for (ll i=p*p; i<=1000001; i+=p)
prime[i] = false;
}
}
}
ll powermod(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; // y = y/2
x = (x*x) % p;
}
return res;
}
ll gcd(ll x, ll y){
if (y == 0)
return x;
else
return gcd(y, x % y);
}
ll nck(ll n, ll k){
ll C[k + 1];
memset(C, 0, sizeof(C));
C[0] = 1;
for (ll i = 1; i <= n; i++) {
for (ll j = min(i, k); j > 0; j--)
C[j] = (C[j]%M + C[j - 1]%M)%M;
}
return C[k]%M;
}
/*void call(vll &primefactor,int N){
for(int i=1;i<N;i++)
{
primefactor[i]=i;
}
for(int i=2;i<N;i++)
{
if(primefactor[i]!=i)
continue;
for(int j=i;j<N;j+=i)
primefactor[j]=i;
}
}*/
string divi(string number, int divisor)
{
// As result can be very large store it in string
string ans;
// Find prefix of number that is larger
// than divisor.
int idx = 0;
int temp = number[idx] - '0';
while (temp < divisor)
temp = temp * 10 + (number[++idx] - '0');
// Repeatedly divide divisor with temp. After
// every division, update temp to include one
// more digit.
while (number.size() > idx) {
// Store result in answer i.e. temp / divisor
ans += (temp / divisor) + '0';
// Take next digit of number
temp = (temp % divisor) * 10 + number[++idx] - '0';
}
// If divisor is greater than number
if (ans.length() == 0)
return "0";
// else return ans
return ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll t=1;
//cin>>t;
while(t--){
string s; ll k; cin>>s>>k;
fo(i,k){
ll n=s.size();
if(n>=3 && s[n-1]=='0' && s[n-2]=='0' && (s[n-3]-'0')%2==0){
string kk=s.substr(0,n-2);
s=divi(kk,2);
}
else
s+="200";
}
cout<<s<<endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define ff first
#define ss second
#define mod 1000000007
#define ull unsigned long long
#define vll vector<ll>
#define uom unordered_map
#define uos unordered_set
#define pll pair<ll, ll>
#define INF 9223372036854775807
#define w(t) ll tests; cin>>tests; while(tests--)
#define endl "\n"
#define pb(x) push_back(x)
#define ppb() pop_back()
#define all(x) x.begin(), x.end()
#define mp(a, b) make_pair(a, b)
#define setp(x, y) fixed << setprecision(x) << y
#define f(i, a, b) for(ll i = a ; i < b ; i++)
#define fo(j, a, b) for(ll j = a ; j >= b ; j--)
#define fill(a, n, x) f(i, 0, n) a[i]=x;
using namespace std;
void init() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int main() {
init();
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n;
cin >> n;
vll v;
ll i = 1;
while (i <= 1e18)
{
v.pb(i);
i *= 2;
}
ll mn = INF;
f(i, 0, v.size())
mn = min(mn, n / v[i] + i + n % v[i]);
cout << mn;
return 0;
} | #include <iostream>
#include <cmath>
#include <climits>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
int main()
{
ull N;
cin >> N;
ull b = floor(log2(N)), sum = LLONG_MAX;
for (int i = 0; i <= b; i += 1)
sum = min(sum, (N / (1ULL << i)) + i + (N % (1ULL << i)));
cout << sum;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll k, dp[262144][18], ok[18][18];
ll solve(ll m, ll e){
if (dp[m][e] != 0) return dp[m][e];
if ((m ^ (1ll << e)) == 0) return dp[m][e] = 1;
dp[m][e] = 1e18;
for (ll i = 0; i < k; i++){
if (ok[i][e] != -1 && m & (1 << i)) dp[m][e] = min(dp[m][e], solve(m & ~(1ll << e), i) + ok[i][e]);
}
return dp[m][e];
}
int main(){
ll n, m, ans = 1e18;
scanf("%ld %lld", &n, &m);
ll a[m], b[m];
vector<ll> ad[n];
for (ll i = 0; i < m; i++){
scanf("%lld %lld", &a[i], &b[i]), a[i]--, b[i]--;
ad[a[i]].emplace_back(b[i]);
ad[b[i]].emplace_back(a[i]);
}
scanf("%lld", &k);
ll c[k];
for (ll i = 0; i < k; i++) scanf("%lld", &c[i]), c[i]--;
for (ll i = 0; i < k; i++){
queue<ll> q;
q.push(c[i]);
ll d[n];
fill(d, d + n, -1);
d[c[i]] = 0;
while (!q.empty()){
ll f = q.front();
q.pop();
for (ll e : ad[f]){
if (d[e] == -1){
d[e] = d[f] + 1;
q.push(e);
}
}
}
for (ll j = 0; j < k; j++) if (i != j) ok[i][j] = d[c[j]];
}
for (ll i = 0; i <= k; i++) ans = min(ans, solve((1ll << k) - 1, i));
if (ans == 1e18) ans = -1;
printf("%lld\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void chmax(ll &x, ll y) {x = max(x,y);}
void chmin(ll &x, ll y) {x = min(x,y);}
void Yes() {cout << "Yes" << endl; exit(0);}
void No() {cout << "No" << endl; exit(0);}
template<class in_Cout> void Cout(in_Cout x) {cout << x << endl; exit(0);}
template<class in_vec_cout>
void vec_cout(vector<in_vec_cout> vec) {
for (in_vec_cout res : vec) {cout << res << " ";}
cout << endl;
}
const ll inf = 1e18;
const ll mod = 1e9 + 7;
ll N;
vector<pair<ld,ld>> P;
ld dist[110][110];
map<ld,bool> rad;
void init() {
cin >> N;
rep(i,N) {
ld x, y; cin >> x >> y;
P.push_back({x,y});
}
rep(i,N) {
rep(j,N) {
if (i==j) continue;
ld from_x = P[i].first, from_y = P[i].second;
ld to_x = P[j].first, to_y = P[j].second;
ld dx = to_x - from_x, dy = to_y - from_y;
dist[i][j] = sqrt(dx*dx+dy*dy);
}
dist[i][N] = dist[N][i] = (ld)100 - P[i].second;
dist[i][N+1] = dist[N+1][i] = P[i].second + (ld)100;
}
dist[N][N+1] = dist[N+1][N] = 200.0;
rep(i,N+2) rep(j,N+2) {
rad[dist[i][j]*0.5] = true;
}
rad[100.0] = true;
}
bool judge(ld r) {
ld d = (ld)2*r;
vector<vector<ll>> G(N+2);
rep(i,N+2) rep(j,N+2) {
if (dist[i][j]>=d) continue;
G[i].push_back(j);
}
queue<ll> que;
que.push(N);
vector<bool> seen(N+2);
seen[N] = true;
while (que.size()) {
ll x = que.front();
que.pop();
for (ll y : G[x]) {
if (seen[y]) continue;
seen[y] = true;
que.push(y);
}
}
return seen[N+1];
}
void solve() {
init();
ld ans = 0.0;
for (auto p : rad) {
ld r = p.first;
bool NG = judge(r);
if (NG) break;
ans = r;
}
cout << fixed << setprecision(10);
cout << ans << endl;
}
int main() {
solve();
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
int main(void)
{
ll n,tmp;
cin >> n;
vector<ll> v;
for(long i=1;i<=sqrt(n);++i)
{
if(n%i==0)
{
cout << i << endl;
if(i!=n/i)
{
v.push_back(n/i);
}
}
}
if(v.size()==0)
{
return 0;
}
for(long i=0;i<=v.size();++i)
{
tmp=v[v.size()-i];
if(tmp!=0)
{
cout << v[v.size()-i] << endl;
}
}
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define PI 3.1415926536
#define ff first
#define ss second
#define int 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 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 REP(i,n) for(i=0;i<n;i++)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void c_p_c()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
int n, m, k;
char graph[501][501];
int vis[501][501];
int times;
int dx[] = { -1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
bool isValid(int x, int y)
{
return x < n && y < m && x >= 0 && y >= 0 && graph[x][y] == 'X';
}
void dfs(int i, int j)
{
if (times == 0)
{
for (int i = 0; i < n; i++)
printf("%s\n", graph[i]);
exit(0);
}
graph[i][j] = '.';
times--;
for (int p = 0; p < 4; p++)
{
int g = i + dx[p];
int h = j + dy[p];
if (isValid(g, h))
{
dfs(g, h);
}
}
}
int32_t main() {
//c_p_c();
FIO;
int n;
cin >> n;
int i;
set<int>se;
for (i = 1; i * i <= n; i++)
{
if (n % i == 0)
{
se.insert(i);
se.insert(n / i);
}
}
for (auto &it : se)
cout << it << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
//typedef complex<D> P;
#define F first
#define S second
const ll MOD=1000000007;
//const ll MOD=998244353;
template<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}
template<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}
template<typename T,typename U>ostream & operator << (ostream &o,const pair<T,U> &A){o<<A.F<<" "<<A.S; return o;}
template<typename T>ostream & operator << (ostream &o,const vector<T> &A){int i=A.size(); for(auto &I:A){o<<I<<(--i?" ":"");} return o;}
template<typename T,typename U>T & chmax(T &a,const U &b){if(a<b){a=b;} return a;}
template<typename T,typename U>T & chmin(T &a,const U &b){if(b<a){a=b;} return a;}
//BEGIN CUT HERE
template <typename T>
struct SegmentTree{
using F = function<T(T,T)>;
int n;
F f;
T ti;
vector<T> dat;
SegmentTree(F f,T ti):f(f),ti(ti){}
void init(int n_){
n=1;
while(n<n_) n<<=1;
dat.assign(n<<1,ti);
}
void build(const vector<T> &v){
int n_=v.size();
init(n_);
for(int i=0;i<n_;i++) dat[n+i]=v[i];
for(int i=n-1;i;i--)
dat[i]=f(dat[(i<<1)|0],dat[(i<<1)|1]);
}
void set_val(int k,T x){
dat[k+=n]=x;
while(k>>=1)
dat[k]=f(dat[(k<<1)|0],dat[(k<<1)|1]);
}
T query(int a,int b){
if(a>=b) return ti;
T vl=ti,vr=ti;
for(int l=a+n,r=b+n;l<r;l>>=1,r>>=1) {
if(l&1) vl=f(vl,dat[l++]);
if(r&1) vr=f(dat[--r],vr);
}
return f(vl,vr);
}
template<typename C>
int find(int st,C &check,T &acc,int k,int l,int r){
if(l+1==r){
acc=f(acc,dat[k]);
return check(acc)?k-n:-1;
}
int m=(l+r)>>1;
if(m<=st) return find(st,check,acc,(k<<1)|1,m,r);
if(st<=l and !check(f(acc,dat[k]))){
acc=f(acc,dat[k]);
return -1;
}
int vl=find(st,check,acc,(k<<1)|0,l,m);
if(~vl) return vl;
return find(st,check,acc,(k<<1)|1,m,r);
}
template<typename C>
int find(int st,C &check){
T acc=ti;
return find(st,check,acc,1,0,n);
}
};
//END CUT HERE
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll H,W,M;
cin>>H>>W>>M;
vector<vector<ll>> ROW(H),COL(W);
for(auto &I:ROW){I.push_back(W);}
for(auto &I:COL){I.push_back(H);}
for(int i=0;i<M;i++){
int X,Y;
cin>>X>>Y;
X--; Y--;
ROW[X].push_back(Y);
COL[Y].push_back(X);
}
for(auto &I:ROW){sort(I.begin(),I.end());}
for(auto &I:COL){sort(I.begin(),I.end());}
ll ans=0;
auto f=[](ll a,ll b){return a+b;};
SegmentTree<ll> Tr(f,0);
Tr.build(vector<ll>(3e5,0));
priority_queue<pll> PQ;
for(int i=0;i<COL[0][0];i++){ans+=ROW[i][0]; PQ.push({ROW[i][0],i});}
for(int i=0;i<ROW[0][0];i++){ans+=COL[i][0];}
for(int i=ROW[0][0]-1;i>=0;i--){
while(!PQ.empty() && PQ.top().F>i){Tr.set_val(PQ.top().S,1); PQ.pop();}
ans-=Tr.query(0,COL[i][0]);
}
cout<<ans<<endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
namespace Ruri{
#define ms(a,b) memset(a,b,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define ce(i,r) i==r?'\n':' '
#define pb push_back
#define all(x) x.begin(),x.end()
#define gmn(a,b) a=min(a,b)
#define gmx(a,b) a=max(a,b)
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int infi=1e9;//infi较大，注意涉及inf相加时爆int
const ll infl=4e18;
inline ll ceil_div(ll a,ll b){ return (a+b-1)/b; }
inline ll pos_mod(ll a,ll b){ return (a%b+b)%b; }
//std::mt19937 rnd(time(0));//std::mt19937_64 rnd(time(0));
}
using namespace Ruri;
namespace Read{
#define ss(a) scanf("%s",a)
inline int ri(){ int x; scanf("%d",&x); return x; }
inline ll rl(){ ll x; scanf("%lld",&x); return x; }
inline db rd(){ db x; scanf("%lf",&x); return x; }
}
namespace DeBug{
#define pr(x) cout<<#x<<": "<<(x)<<endl
#define pra(x,a,b) cout<<#x<<": "<<endl; \
repi(i,a,b) cout<<x[i]<<" "; \
puts("");
#define FR(a) freopen(a,"r",stdin)
#define FO(a) freopen(a,"w",stdout)
}
using namespace Read;
using namespace DeBug;
const int MAX_N=505;
struct node{
int x,y,z;
bool operator <(const node &a)const{ return x<a.x; }
};
typedef pair<ll,node> P;
int r,c;
int a[MAX_N][MAX_N],b[MAX_N][MAX_N];
ll dis[MAX_N][MAX_N][2];
void Dijkstra()
{
repi(i,1,r)repi(j,1,c) dis[i][j][0]=dis[i][j][1]=infl;
priority_queue<P,vector<P>,greater<P> > q;
dis[1][1][1]=0,q.push(P(0,node{1,1,1}));
while(!q.empty())
{
P now=q.top(); q.pop();
int x=now.se.x,y=now.se.y,z=now.se.z;
if(dis[x][y][z]<now.fi) continue;
if(z==0){
if(!r) continue;
if(dis[x-1][y][0]>dis[x][y][z]+1)
dis[x-1][y][0]=dis[x][y][z]+1,q.push(P(dis[x-1][y][0],node{x-1,y,0}));
if(dis[x-1][y][1]>dis[x][y][z]+1)
dis[x-1][y][1]=dis[x][y][z]+1,q.push(P(dis[x-1][y][1],node{x-1,y,1}));
}
else{
if(y<c&&dis[x][y+1][z]>dis[x][y][z]+a[x][y])
dis[x][y+1][z]=dis[x][y][z]+a[x][y],q.push(P(dis[x][y+1][z],node{x,y+1,z}));
if(y&&dis[x][y-1][z]>dis[x][y][z]+a[x][y-1])
dis[x][y-1][z]=dis[x][y][z]+a[x][y-1],q.push(P(dis[x][y-1][z],node{x,y-1,z}));
if(x<r&&dis[x+1][y][z]>dis[x][y][z]+b[x][y])
dis[x+1][y][z]=dis[x][y][z]+b[x][y],q.push(P(dis[x+1][y][z],node{x+1,y,z}));
if(r&&dis[x][y][0]>dis[x][y][z]+1)
dis[x][y][0]=dis[x][y][z]+1,q.push(P(dis[x][y][0],node{x,y,0}));
}
}
}
int main()
{
r=ri(),c=ri();
repi(i,1,r)repi(j,1,c-1) a[i][j]=ri();
repi(i,1,r-1)repi(j,1,c) b[i][j]=ri();
Dijkstra();
printf("%lld\n",dis[r][c][1]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (ll i = l; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
const ld PI = 3.1415926535897932;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
vll dx = {-1,0,1,0};
vll dy = {0,-1,0,1};
vll Dx = {-1,-1,-1,0,0,1,1,1};
vll Dy = {-1,0,1,-1,1,-1,0,1};
const ll INF = 1000000000000000;
vll F(400001);
vll G(400001);
ll nCr_mod3(ll n,ll r) {
if (n == r || r == 0) {return 1;}
else {
if (F[n] > F[r] + F[n - r]) {
return 0;
}
else {
if (G[n] == G[r]*G[n - r]%3) {return 1;}
else {return 2;}
}
}
return 0;
}
int main() {
rep(i,400001) {
if (i == 0) {
F[i] = 0;G[i] = 0;
}
else if (i == 1) {
F[i] = 0;G[i] = 1;
}
else {
ll f = i;
F[i] = F[i - 1];
while(f%3 == 0) {
f /= 3;
F[i]++;
}
G[i] = G[i - 1]*f%3;
}
}
ll N;
cin >> N;
string C;
cin >> C;
vll V(N);
rep(i,N) {
if (C[i] == 'B') {V[i] = 0;}
if (C[i] == 'W') {V[i] = 1;}
if (C[i] == 'R') {V[i] = 2;}
}
ll ans = 0;
rep(i,N) {
ans += V[i]*nCr_mod3(N - 1,i);
ans %= 3;
}
if (N%2 == 0) {
if (ans == 0) {cout << "B" << endl;}
else if (ans == 1) {cout << "R" << endl;}
else {cout << "W" << endl;}
}
else {
if (ans == 0) {cout << "B" << endl;}
else if (ans == 1) {cout << "W" << endl;}
else {cout << "R" << endl;}
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll>vl1;
typedef vector<vl1> vl2;
typedef vector<double> vd1;
typedef vector<vl1> vl2;
struct struka
{ll val; ll ind;};
typedef vector<struka> vs;
bool compa(struka& a, struka& b)
{ if(a.val==b.val) return a.ind<b.ind;
return a.val<b.val;
}
void radi()
{ ll i, j, k, kn, m, n, p, t, l, r, x, y, z, a, b, c, d, ost;
ll val, pos, tmp, suma, maxa, mina, naso, num, dole, gore, sred;
double dval;
string str1;
char ch1;
cin>>n;
vd1 dp(n+2);
dp[n]=0;
for(i=n-1;i>=0;i--)
{ dval= ((n-i)*1.)/n;
dp[i]=(1.+dp[i+1]*dval)/dval;}
cout<<fixed<<setprecision(10);
cout<<dp[0]-1.;
}
int main()
{ ll t, p;
t=1;
for(p=1;p<=t;p++) radi();
return 0;
}
/*
*/
|
Subsets and Splits