SDUT 2021 Winter Individual Contest - J(Gym-101879)
2024-05-07 09:57:45
Gym-101879
- B - Aesthetics in poetry
- D - Maximizing Advertising
- E - Group work
- G - Running a penitentiary
- I - A story about tea
- J - Meme Wars
B - Aesthetics in poetry
题目链接
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;ll dp[N];
int vis[N];bool judge(int n,ll key){if(n%key) return 0;memset(vis,0,sizeof(vis));rep(i,1,n) vis[dp[i]%key]++;rep(i,0,key-1){if(vis[i]!=n/key) return 0;}return 1;
}void solve(){int n;cin>>n;rep(i,1,n) cin>>dp[i];ll res;bool flag=0;for(ll i=2;i<=n;i++){if(judge(n,i)){res=i;flag=1;break;}}if(flag) cout<<res<<endl;else cout<<-1<<endl;
}int main() {solve();return 0;
}D - Maximizing Advertising
题目链接
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;struct node{int x;int y;int sum;
}dp[N];int tot;
int cnt;bool cmp(node x,node y){if(x.x<y.x) return 1;else if(x.x==y.x&&x.y<y.y) return 1;return 0;
}bool bmp(node x,node y){if(x.y<y.y) return 1;else if(x.y==y.y&&x.x<y.x) return 1;return 0;
}void solve(){int n;cin>>n;string s;rep(i,1,n){cin>>dp[i].x>>dp[i].y>>s;if(s[0]=='b'){dp[i].sum=0;tot++;}else{dp[i].sum=1;cnt++;}}sort(dp+1,dp+1+n,cmp);int b=tot;int w=cnt;int sumb=0;int sumw=0;int maxn=max(b,w);rep(i,1,n){if(!dp[i].sum) b--,sumb++;else w--,sumw++;maxn=max(maxn,max(b+sumw,w+sumb));}sort(dp+1,dp+1+n,bmp);b=tot;w=cnt;sumb=0;sumw=0;//maxn=max(b,w);rep(i,1,n){if(!dp[i].sum) b--,sumb++;else w--,sumw++;maxn=max(maxn,max(b+sumw,w+sumb));}cout<<maxn<<endl;
}int main() {solve();return 0;
}
E - Group work
题目链接
题意
给定n个人，问组队种类的最多数量
组队要求：
- 每队大于等于两人
- 队伍中有一人不同就算不同队伍
思路
n个元素的集合，元素数量大于1的真子集数目
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;void solve(){int n;cin>>n;int tot=1;rep(i,0,n-1) tot*=2;tot-=n+1;cout<<tot<<endl;
}int main() {solve();return 0;
}G - Running a penitentiary
题目链接
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;int n,m;
int dp[N];
int mp[N];
int st1[N];
int st2[N];void up1(int k){while(k<=n){st1[k]=dp[k];for(int i=1;i<(lowbit(k));i<<=1) st1[k]=max(st1[k],st1[k-i]);k+=lowbit(k);}
}void up2(int k){while(k<=n){st2[k]=mp[k];for(int i=1;i<(lowbit(k));i<<=1) st2[k]=max(st2[k],st2[k-i]);k+=lowbit(k);}
}int que1(int l,int r){int res=-INF;while(l<=r){res=max(res,dp[r]);for(--r;l<=r-(lowbit(r));r-=lowbit(r)) res=max(res,st1[r]);}return res;
}int que2(int l,int r){int res=-INF;while(l<=r){res=max(res,mp[r]);for(--r;l<=r-(lowbit(r));r-=lowbit(r)) res=max(res,st2[r]);}return -res;
}void solve(){cin>>n>>m;rep(i,1,n){cin>>dp[i]>>mp[i];mp[i]=-mp[i];up1(i);up2(i);}while(m--){int l,r;string ope;cin>>ope;if(ope[0]=='?'){cin>>l>>r;ll L=1ll*que1(l,r);ll R=1ll*que2(l,r);if(L>R) puts("0");else cout<<R-L+1<<endl;}else{int pos;cin>>pos>>l>>r;dp[pos]=l;mp[pos]=-r;up1(pos);up2(pos);}}
}int main() {solve();return 0;
}
I - A story about tea
题目链接
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;int tot;void hanno(int n,char a,char b,char c){if(n==0) return ;hanno(n-1,a,c,b);if(tot&&n==1){cout<<a<<" "<<b<<endl;cout<<b<<" "<<c<<endl;tot=0;}else cout<<a<<" "<<c<<endl;hanno(n-1,b,a,c);
}void solve(){int n,k;cin>>n>>k;tot=k-(1<<n)+1;if(tot<0){puts("N");return ;}else{puts("Y");while(tot>=2){puts("A B");puts("B A");tot-=2;}}hanno(n,'A','B','C');
}int main() {solve();return 0;
}
J - Meme Wars
题目链接
答案
#include <iostream>
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,b) for(auto i=a;i<=b;++i)
#define bep(i,a,b) for(auto i=a;i>=b;--i)
#define lowbit(x) x&(-x)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(-1)
#define pb push_back
#define eps 1e-6
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const int M = 211;
int dx[]={-1, 0, 1, 0};
int dy[]={0, 1, 0, -1};
using namespace std;void solve(){int n;cin>>n;int tot=0;while(n%2==0){tot++;n/=2;}char s=tot+'a';cout<<s<<endl;
}int main() {solve();return 0;
}SDUT 2021 Winter Individual Contest - J(Gym-101879)相关推荐
- SDUT 2021 Winter Individual Contest - G
Kattis A - Basketball One-on-One C - Convoy F - Dragon Ball I H - Farming Mars I - Soft Passwords L ...
- SDUT 2021 Spring Individual Contest(for 20) - 1
文章目录 A - Sherlock Bones B - Unusual Team C - Cheap Kangaroo D - Magical Bamboos E - Competitive Seag ...
- SDUT 2021 Spring Individual Contest(for 20) - 2
文章目录 Taymyr is calling you City WERTYU Heist E Find The Multiple Prime Path Sum of Consecutive Prime ...
- SDUT 2022 Winter Individual Contest - D(K)
链接: link. K - Dishonest Driver 题意: 给定一个长度为 N N N的字符串,现在需要将字符串进行压缩,压缩的规则就是相同的子串的可以缩写,例如 a a a b a a a ...
- SDUT 2021 Spring Individual Contest(for 20) - 9（2）（部分）补题
A - hzy 和zsl 的生存挑战 zsl 和hzy 来到了臭臭城堡,打算挑战臭臭城堡的大魔王hyz,大魔王hyz设置了这样的一个挑战: zsl 和hzy两个人各自来到一间密室,期间两人无法以任何形 ...
- SDUT 2022 Summer Individual Contest - 12(for 21）
------水赛总结 A - Window Gym - 101020A Jerry Smith is Rick's Son-in-Law and Morty's father. He recently ...
- NOMURA Programming Contest 2021(AtCoder Regular Contest 121)
文章目录 A - 2nd Greatest Distance B - RGB Matching C - Odd Even Sort D - 1 or 2 E - Directed Tree F - L ...
- Caddi Programming Contest 2021(AtCoder Beginner Contest 193) 题解
Caddi Programming Contest 2021(AtCoder Beginner Contest 193) A - Discount 打折浮点数除即可 B - Play Snuke 枚举 ...
- 2021 ICPC 沈阳赛区J题 Luggage Lock
2021 ICPC 沈阳赛区J题 Luggage Lock 题意 有TTT组样例,其中每组样例为: 给定一个密码为b0b1b2b3b_0b_1b_2b_3b0b1b2b3的密码锁,已知当前密码 ...
最新文章
- 【重磅】Python版《统计学习导论》来啦！附代码链接！
- C# 控件置于最顶层、最底层
- 转载_最值得阅读学习的10个C语言开源项目代码
- Python 的 eval() 与 exec()区别
- laravel+php+支付功能,laravel+微信支付源码
- 利用VC++实现局域网实时传输
- 苹果忘记开机密码_苹果电脑忘记开机密码快速恢复的方法！
- 遇到一个把.o文件strip后出现的奇怪问题
- 前端悬浮窗效果_web前端入门到实战：css过渡和动画解析文
- jQuery操作input值总结
- Git小乌龟的安装及使用
- 写论文：证明非线性系统的稳定性
- 部署LAMP平台，构建企业web服务器
- M システム - 笔记(4) -- 客户合作胜过合同谈判
- 三顾讯时--对讯时新闻发布系统的艰难突破
- sql注入--宽字节注入
- Java的wait()、notify()学习三部曲之一：JVM源码分析
- 剑指offer73：狒狒吃香蕉
- [每天进步一点点~] uni-app 安装配置安卓手机模拟器
- 【纸牌屋】第一季第一集经典台词