传送门:https://www.bnuoj.com/v3/contest_show.php?cid=8520
A. Nearest Neighbor Search
题目大意:给出一个点以及一个立方体的对角点,求这个点到立方体的最短距离。
解题思路:对这个点的x、y、z进行分析,分别有两种情况:在对角点间的为0,不在对角点间的取绝对值小的那个(因为可能坐标为负数)。
/* ***********************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ 马 ┏━┛ ┆
┆ ┃ 勒 ┃ ┆
┆ ┃ 戈 ┗━━━┓ ┆
┆ ┃ 壁 ┣┓┆
┆ ┃ 的草泥马 ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define mem(x,v) memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
int x,y,z;
int x1,y1,z1;
int x2,y2,z2;
while(~scanf("%d%d%d",&x,&y,&z))
{
scanf("%d%d%d",&x1,&y1,&z1);
scanf("%d%d%d",&x2,&y2,&z2);
int a,b,c;
if(x>=x1 && x<=x2)a=0;
else
{
a = min(abs(x-x1),abs(x-x2));
}
if(y>=y1 && y<=y2)b=0;
else
{
b = min(abs(y-y1),abs(y-y2));
}
if(z>=z1 && z<=z2)c=0;
else
{
c = min(abs(z-z1),abs(z-z2));
}
LL ans = (LL)a*a + (LL)b*b + (LL)c*c;
printf("%lld\n",ans);
}
return 0;
}
题目大意:给你一元、两元、三元面值的硬币a、b、c个,问能买有多少种不同价钱的东西。
解题思路:非常恶心的分类讨论……
/* ***********************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ 马 ┏━┛ ┆
┆ ┃ 勒 ┃ ┆
┆ ┃ 戈 ┗━━━┓ ┆
┆ ┃ 壁 ┣┓┆
┆ ┃ 的草泥马 ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define mem(x,v) memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
LL a,b,c;
while(~scanf("%lld%lld%lld",&a,&b,&c))
{
LL ans=0;
if(!a && !b && !c) ans=0;
else if(!a && !b) ans=c;
else if(!a && !c) ans=b;
else if(!b && !c) ans=a;
else if(a==0)
{
if(b>1) ans=2LL*b+3LL*c-2;
else ans=2LL*c+b;
}
else if(b==0)
{
if(a==1) ans=a+2LL*c;
else ans=a+3LL*c;
}
else if(c==0) ans=a+2LL*b;
else ans=a+2LL*b+3LL*c;
printf("%lld\n",ans);
}
return 0;
}
F. Floyd-Warshall
/* ***********************************************
┆ ┏┓ ┏┓ ┆
┆┏┛┻━━━┛┻┓ ┆
┆┃ ┃ ┆
┆┃ ━ ┃ ┆
┆┃ ┳┛ ┗┳ ┃ ┆
┆┃ ┃ ┆
┆┃ ┻ ┃ ┆
┆┗━┓ 马 ┏━┛ ┆
┆ ┃ 勒 ┃ ┆
┆ ┃ 戈 ┗━━━┓ ┆
┆ ┃ 壁 ┣┓┆
┆ ┃ 的草泥马 ┏┛┆
┆ ┗┓┓┏━┳┓┏┛ ┆
┆ ┃┫┫ ┃┫┫ ┆
┆ ┗┻┛ ┗┻┛ ┆
************************************************ */
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;
#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define mem(x,v) memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}
//#pragma comment(linker, "/STACK:102400000,102400000")
const int N = 1e5 + 305;
struct Edge
{
int to,nx;
}edge[N*2];
int head[N],cnt;
void addedge(int u,int v)
{
edge[cnt] = Edge{v,head[u]};
head[u] = cnt++;
}
int dep[N],vis[N],p[N],Q[N];
int f[N][25],b[300][N];
int n,m,q;
pii L[N];
void dfs(int u,int d)
{
dep[u] = d;
vis[u] = 1;
for(int i=head[u];~i;i=edge[i].nx)
{
int v = edge[i].to;
if(vis[v])continue;
f[v][0] = u;
dfs(v,d+1);
}
}
int lca(int x,int y)
{
if(dep[x]<dep[y]) swap(x,y);
for(int i=20;i>=0;i--)
{
if(dep[f[x][i]]>=dep[y])
x = f[x][i];
}
if(x==y) return x;
for(int i=20;i>=0;i--)
{
if(f[x][i]!=f[y][i])
{
x = f[x][i], y = f[y][i];
}
}
return f[x][0];
}
void bfs(int o)
{
int s = p[o];
int x = 0, y = 1;
Q[y] = s;
for(int i=1;i<=n;i++) b[o][i] = -1;
b[o][s] = 0;
while(x<y)
{
int u = Q[++x];
for(int i=head[u];~i;i=edge[i].nx)
{
int v = edge[i].to;
if(b[o][v]<0)
{
b[o][v] = b[o][u] + 1;
Q[++y] = v;
}
}
}
}
set<int>s;
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ios::sync_with_stdio(0);
cin.tie(0);
scanf("%d%d%d",&n,&m,&q);
memset(head,-1,sizeof head);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
L[i] = mp(x,y);
addedge(x,y);
addedge(y,x);
}
dfs(1,1);
for(int j=1;j<=20;j++)
{
for(int i=1;i<=n;i++)
{
f[i][j] = f[f[i][j-1]][j-1];
}
}
for(int i=1;i<=m;i++)
{
int x = L[i].first;
int y = L[i].second;
if(x==y || x==f[y][0] || y==f[x][0]) continue;
s.insert(x);
s.insert(y);
}
int top = 0;
for(set<int>::iterator it = s.begin();it!=s.end();it++)
{
p[++top] = *it;
}
for(int i=1;i<=top;i++)
bfs(i);
for(int i=1;i<=q;i++)
{
int x,y;
scanf("%d%d",&x,&y);
int z = lca(x,y);
int ans = (dep[x]-dep[z]) + (dep[y]-dep[z]);
for(int i=1;i<=top;i++)
ans = min(ans,b[i][x]+b[i][y]);
printf("%d\n",ans);
}
return 0;
}