2021 ICPC 南京 3.27训练赛

while WA er

已于 2022-03-28 22:14:17 修改

阅读量1k

点赞数

分类专栏： acmer 文章标签： c++ 算法数据结构

于 2022-03-28 14:41:44 首次发布

本文链接：https://blog.csdn.net/peacesir/article/details/123795064

版权

acmer 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

2021 ICPC 南京

D - Paimon Sorting
J - Xingqiu's Joke
I - Cloud Retainer's Game

题目链接

D - Paimon Sorting

思维+树状数组

当时少考虑了相同最大值对后面的影响，策略不太对，以后我有思路的就自己写好了。

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define sr4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d);
#define f(i,a,n) for(int i=a;i<=n;i++)
#define ff(i) for(int i=1;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
// #define int long long
// #define int __int128
#define dd double
const int N=1e6+5;
int vis[N];
long long ans=0;
int maxn=0,n;
int a[N];
int num[N];
void add(int x,int val)
{
	for(;x<N;x+=x&-x) a[x]+=val;
}
int ask(int x)
{
	int ans=0;
	for(;x;x-=x&-x) ans+=a[x];
	return ans;
}
inline void solve()
{
	ans=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++) 
	{
		scanf("%d",&num[i]);
		a[i]=0;
		vis[i]=0;
	}
	printf("%lld",ans);
	int flag=0;
	int nmax=num[1];
	add(num[1],1);
	vis[num[1]]=1;
	int cnt=0;
	for(int i=2;i<=n;i++)
	{
		if(!vis[num[i]])vis[num[i]]=1,add(num[i],1);
		if(num[i]==nmax)
		{
			flag=1;
		}
		cnt+=flag;
		if(num[i]>nmax)
		{
			ans+=2+max(0,cnt-1);
			nmax=num[i];
			flag=0;
			cnt=0;
		}
		ans+=ask(nmax)-ask(num[i]);
		printf(" %lld",ans);
	}
	puts("");
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<<endl<< "Time used:" << clock() - c1 << endl;
	return 0;
}

J - Xingqiu’s Joke

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define sr4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d);
#define f(i,a,n) for(int i=a;i<=n;i++)
#define ff(i) for(int i=1;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
// #define int long long
// #define int __int128
#define LL long long
#define dd double
const int N=1e6+5;

int cnt=0;
int prime[N],vis[N];
int length=0;
void get_pri(int x)
{
	for(int i=2;i<=x;i++)
	{
		if(!vis[i]) prime[++length]=i;
		for(int j=i+i;j<=x;j=j+i)
		{
			vis[j]=1;
		}
	}
	if(x>1)
	prime[++length]=x;
}

int pri[N];
void divide(int x)
{
	for(int i=1;prime[i]*prime[i]<=x;i++)
	{
		if(x%prime[i]==0)pri[++cnt]=prime[i];
		while(x%prime[i]==0)x/=prime[i];
	}
	if(x>1) pri[++cnt]=x;
}
LL _hash(int a,int b)
{
	return a*1e9+b;
}

unordered_map<LL,int>dp;

int dfs(int a,int b)
{
	if(a==1) return 0;
	if(b==1) return a-1;
	if(dp[_hash(a,b)]) return dp[_hash(a,b)];
	int minn=a-1;
	for(int i=1;i<=cnt;i++)
	{
		if(b%pri[i]==0)
		{
			int res=a%pri[i];
			// sc(res)
			// cout<<a<<" "<<b<<" "<<res+1+dfs(a/pri[i],b/pri[i])<<endl;
			minn=min(minn,res+1+dfs(a/pri[i],b/pri[i]));
			minn=min(minn,pri[i]-res+1+dfs(a/pri[i]+1,b/pri[i]));
		}
	}
	return dp[_hash(a,b)]=minn;
}


void init()
{
	cnt=0;
	dp.clear();
}

inline void solve()
{
	init();
	int a,b;
	scanf("%d%d",&a,&b);
	if(a>b)swap(a,b);
	int c=b-a;
	divide(c);
	// sc(c)
	// for(int i=1;i<=10;i++)cout<<prime[i]<<" ";hh
	// for(int i=1;i<=cnt;i++)cout<<pri[i]<<" ";hh
	printf("%d\n",dfs(a,c));
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	get_pri(1e6);
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<<endl<< "Time used:" << clock() - c1 << endl;
	return 0;
}

I - Cloud Retainer’s Game

首先说一下这道题，给了一个二维的平面，可以发现球在弹的过程中只会改变ｙ的方向，而且是只会正负变化。一开始的方向是｛１，１｝这里很关键，他是４５°　
想一下如果没有碰到板子的话他的沿途所有的分数该怎么记录
首先考虑向右下方向
x+y其实就是斜率为-1的一条直线，我们要卡到边界（0，H）上，这个时候x+y的最大值就是2*H
所以表示直线就是（ｘ＋ｙ）％２＊Ｈ

考虑右上方向的直线
在这里插入图片描述
则是（2H-y+x）%2H
要从把挡板和硬币按照x排序，当前是硬币的时候在对应直线上边的分值+1，当前是挡板的时候我们现在有两个方向可以走，这两个方向当前的获得分数应该是他们的最大值。有点DP的感觉

//acmer mxc
#include<bits/stdc++.h>
#define mst(s,x) memset(s,x,sizeof(s));
#define sr(x) scanf("%lld",&x); 
#define sr2(a,b) scanf("%d%d",&a,&b); 
#define sr3(a,b,c) scanf("%d%d%d",&a,&b,&c); 
#define sr4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d);
#define f(i,a,n) for(int i=a;i<=n;i++)
#define ff(i) for(int i=1;i<=n;i++)
#define sc(x) cout<<#x<<" : "<<x<<endl;
#define hh cout<<endl;
//#define int __int128
#define pii pair<int,int>
#define pb(x) push_back(x)
#define mk(a,b) make_pair(a,b)
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fi first
#define se second
#define ll __int128
#define inf 0x3f3f3f3f
using namespace std;
inline ll read()
{
	ll x=0,w=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
	while(c<='9'&&c>='0') x=(x<<1)+(x<<3)+c-'0',c=getchar();
	return w==1?x:-x;
}
inline void write(ll x)
{
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
//------------------------------------------------
// #define int long long
// #define int __int128
#define LL long long
#define dd double
const int N=1e6+5;

struct point
{
	int x,y;
	int flag=0;
};
int H,n,m;
vector<point>v;
unordered_map<int,int>dp;
bool cmp(point a,point b)
{
	return a.x<b.x;
}
void cal()
{

	int ans=1;
	dp[0]=1;
	for(int i=0;i<n+m;i++)
	{
		int x=v[i].x,y=v[i].y,c=v[i].flag;
		if(c==1)
		{
			
			if(dp[(x+y)%(2*H)])dp[(x+y)%(2*H)]++;
			if(dp[(2*H-y+x)%(2*H)])dp[(2*H-y+x)%(2*H)]++;
		}
		else if(c==0)
		{
			int tp=max(dp[(x+y)%(2*H)],dp[(2*H-y+x)%(2*H)]);
			dp[(2*H-y+x)%(2*H)]=tp;
			dp[(x+y)%(2*H)]=tp;
		}
	}
	for(auto v:dp)ans=max(ans,v.se);
	printf("%d\n",ans-1);
}
void init()
{
	dp.clear();
	v.clear();
}

inline void solve()
{
	init();
	scanf("%d%d",&H,&n);
	for(int i=1;i<=n;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		point t;
		t.x=x,t.y=y,t.flag=0;
		v.push_back(t);
	}
	scanf("%d",&m);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		point t;
		t.x=x,t.y=y,t.flag=1;
		v.push_back(t);
	}
	sort(v.begin(),v.end(),cmp);
	cal();
}

//------------------------------------------------
signed main()
{
	clock_t c1=clock();
#ifdef LOCAL
    freopen("in.in","r",stdin);
    freopen("out.out","w",stdout);
#endif
//==================================
    int T=1;
	cin>>T;
	for(int i=1;i<=T;i++)
	{
		solve();
	}
//==================================
end:
    cerr<<endl<< "Time used:" << clock() - c1 << endl;
	return 0;
}

while WA er

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
打赏
0
评论
2021 ICPC 南京 3.27训练赛

2021 ICPC 南京 D - Paimon SortingD - Paimon Sorting思维+树状数组当时少考虑了相同最大值对后面的影响，策略不太对，以后我有思路的就自己写好了。//acmer mxc#include<bits/stdc++.h>#define mst(s,x) memset(s,x,sizeof(s));#define sr(x) scanf("%lld",&x); #define sr2(a,b) scanf("%d%d",&a,&a
复制链接

扫一扫