A Add Odd or Subtract Even
分類討論
import java.util.Scanner;
public class a
{
public static void main(String[] args)
{
int T, a, b, i, ans;
Scanner input = new Scanner(System.in);
T = input.nextInt();
for(i=1;i<=T;i++)
{
a=input.nextInt();
b=input.nextInt();
if(a==b)ans=0;
else if(a>b)
{
if(a%2==b%2)ans=1;
else ans=2;
}
else
{
if(a%2==b%2)ans=2;
else ans=1;
}
System.out.println(ans);
}
}
}
B WeirdSort
每個聯通塊內部排序
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll p[maxn], a[maxn], tmp[maxn];
int main()
{
ll n, i, m, T=read(), last;
while(T--)
{
n=read(), m=read();
rep(i,1,n)a[i]=read();
rep(i,1,n)tmp[i]=a[i];
cl(p);rep(i,1,m)p[read()]++;
last=-1;
rep(i,1,n)
{
if(p[i])if(last==-1)last=i;
if(!p[i])
{
if(last==-1)continue;
sort(tmp+last,tmp+i+1);
last=-1;
}
}
if(last!=-1)sort(tmp+last,tmp+n+1);
sort(a+1,a+n+1);
if(vector<ll>(a+1,a+n+1) == vector<ll>(tmp+1,tmp+n+1))printf("YES\n");
else printf("NO\n");
}
return 0;
}
C Perform the Combo
後綴和
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll ans[300];
char s[maxn];
ll p[maxn], cnt[maxn];
int main()
{
ll T=read(), n, m, i;
while(T--)
{
n=read(), m=read();
rep(i,1,n+1)cnt[i]=0;
scanf("%s",s+1);
rep(i,1,m)cnt[read()]++;
drep(i,n,1)cnt[i]+=cnt[i+1];
cl(ans);
rep(i,1,n)ans[s[i]]+=cnt[i]+1;
rep(i,'a','z')printf("%lld ",ans[i]);
putchar(10);
}
return 0;
}
D Three Integers
枚舉,然後枚舉的約數,枚舉的倍數
都枚舉道最多即可,因爲一種很極端的情況就是,比這個更大的情況肯定都更劣
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll T, a, b, c;
int main()
{
ll i, ans, j, db, dc, tmp, k;
T=read();
while(T--)
{
a=read(), b=read(), c=read();
vector<ll> ans{linf,0,0,0};
for(i=1;i<=20000;i++)
{
ll mid = abs(i-b), besta=linf, bestc=linf;
for(j=1;j*j<=i;j++)
{
if(i%j==0)
{
if(abs(besta-a)>abs(j-a))besta=j;
if(abs(besta-a)>abs(i/j-a))besta=i/j;
}
}
for(j=i;j<=20000;j+=i)
if(abs(bestc-c)>abs(j-c))bestc=j;
ans = min( ans, { abs(i-b) + abs(a-besta) + abs(c-bestc), besta, i, bestc } );
}
printf("%lld\n%lld %lld %lld\n",ans[0],ans[1],ans[2],ans[3]);
}
return 0;
}
E Construct the Binary Tree
從深度序列的角度來考慮,我一上來先搞一個完全二叉樹的深度序列。
然後每次取最後面的一個可以的數讓他(得保證完了以後這棵樹還是合法的)
最後根據度數序列構造出整棵樹
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 5050
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll n, d, lis[maxn], cnt[maxn], now;
vector<ll> v[maxn];
int main()
{
ll T=read(), i, j;
while(T--)
{
n=read(), d=read();
if(d>n*(n-1)/2)
{
printf("NO\n");
continue;
}
cl(cnt), cl(lis);
lis[1]=0, lis[2]=1;
cnt[0]=1, cnt[1]=1;
rep(i,3,n)
{
if(cnt[lis[i-1]]==cnt[lis[i-1]-1]*2)lis[i]=lis[i-1]+1;
else lis[i]=lis[i-1];
cnt[lis[i]]++;
}
now=0;
rep(i,1,n)now+=lis[i];
if(now>d){printf("NO\n");continue;}
while(now<d)
{
drep(i,n,1)
{
if(cnt[lis[i]]>1)
{
cnt[lis[i]]--;
lis[i]++;
cnt[lis[i]]++;
break;
}
}
now++;
}
rep(i,0,n)v[i].clear();
printf("YES\n");
v[0].emb(1);
rep(i,2,n)
{
v[lis[i]].emb(i);
ll num=v[lis[i]].size()-1;
printf("%lld ",v[lis[i]-1][num>>1]);
}
putchar(10);
}
return 0;
}
F Moving Points
先按照排序,然後求如下式子
兩個樹狀數組就可以搞定了
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
ll c, f(1);
for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
for(;isdigit(c);c=getchar())x=x*10+c-0x30;
return f*x;
}
ll n;
pll pt[maxn];
struct BIT
{
ll bit[maxn], n;
void init(int N){n=N;for(int i=1;i<=n;i++)bit[i]=0;}
ll lowbit(ll x){return x&(-x);}
void add(ll pos, ll v)
{
for(;pos<=n;pos+=lowbit(pos))bit[pos]+=v;
}
ll sum(ll pos)
{
ll ans(0);
for(;pos;pos-=lowbit(pos))ans+=bit[pos];
return ans;
}
}bit_sum, bit_cnt;
struct Lisan
{
int tmp[maxn], tot;
void clear(){tot=0;}
void insert(int x){tmp[++tot]=x;}
void run()
{
sort(tmp+1,tmp+tot+1);
tot=unique(tmp+1,tmp+tot+1)-tmp-1;
}
void lisan(int *a, int len)
{
for(int i=1;i<=len;i++)a[i]=lower_bound(tmp+1,tmp+tot+1,a[i])-tmp;
}
int lisan(int x)
{
return lower_bound(tmp+1,tmp+tot+1,x)-tmp;
}
}ls;
int main()
{
ll n=read(), i, ans=0;
rep(i,1,n)pt[i].first=read();
rep(i,1,n)pt[i].second=read();
rep(i,1,n)
{
ls.insert(pt[i].second);
ls.insert(pt[i].second-1);
}
ls.run();
bit_sum.init(ls.tot);
bit_cnt.init(ls.tot);
rep(i,1,n)pt[i].second=ls.lisan(pt[i].second);
sort(pt+1,pt+n+1);
drep(i,n,1)
{
ll sum=bit_sum.sum(bit_sum.n)-bit_sum.sum(pt[i].second-1), cnt=bit_cnt.sum(bit_cnt.n)-bit_cnt.sum(pt[i].second-1);
ans += sum - pt[i].first*cnt;
bit_sum.add(pt[i].second,pt[i].first);
bit_cnt.add(pt[i].second,+1);
}
printf("%lld",ans);
return 0;
}