CF573A
题意 根据一个数%4的余数不同划分等级 你可以使一个数加上0,1,2 问你使他能升的最大等级是多少 要加多少 根据题意模拟一下即可
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n;
scanf("%d",&n);
if(n%4==0)
{
printf("1 A\n");
}
else if(n%4==1)
{
printf("0 A\n");
}
else if(n%4==2)
{
printf("1 B\n");
}
else
{
printf("2 A\n");
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
cf573B
讲的是麻将 三个一样的就是需要的 或者同花顺三个连续的一样规格也行
就是分不用画一个 要画一个 要画两个进行模拟
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
char a[5],b[5],c[5];
int A,B,C;
scanf("%d%s%d%s%d%s",&A,a,&B,b,&C,c);
if(A==B&&B==C&&a[0]==b[0]&&b[0]==c[0])
{
printf("0\n");
}
else if(a[0]==b[0]&&b[0]==c[0])
{
if((A+B+C)%3==0)
{
int tmp = (A+B+C)/3;
bool flag = false;
if(A==tmp||B==tmp||C==tmp) flag = true;
if(flag)
{
if(min(A,min(B,C))==tmp-1) printf("0\n");
else if(max(A,B)-min(A,B)==2||max(A,C)-min(A,C)==2||max(B,C)-min(B,C)==2) printf("1\n");
else printf("2\n");
}
else
{
if(max(A,B)-min(A,B)==2||max(A,C)-min(A,C)==2||max(B,C)-min(B,C)==2||max(A,B)-min(A,B)==1||max(A,C)-min(A,C)==1||max(B,C)-min(B,C)==1||A==B||B==C||A==C)
{
printf("1\n");
}
else
{
printf("2\n");
}
}
}
else
{
if(max(A,B)-min(A,B)==2||max(A,C)-min(A,C)==2||max(B,C)-min(B,C)==2||max(A,B)-min(A,B)==1||max(A,C)-min(A,C)==1||max(B,C)-min(B,C)==1||A==B||B==C||A==C)
{
printf("1\n");
}
else printf("2\n");
}
}
else if((A==B&&a[0]==b[0])||(B==C&&b[0]==c[0])||(A==C&&a[0]==c[0])) printf("1\n");
else if((max(A,B)-min(A,B)==1&&a[0]==b[0])||(max(C,B)-min(C,B)==1&&b[0]==c[0])||(max(A,C)-min(C,A)==1&&a[0]==c[0])||(max(A,B)-min(A,B)==2&&a[0]==b[0])||(max(C,B)-min(C,B)==2&&b[0]==c[0])||(max(A,C)-min(C,A)==2&&a[0]==c[0])) printf("1\n");
else printf("2\n");
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
cf573C
题意 就是给你n个东西 期中有m个特殊物品 k个格子为一页
每次只能对含特殊物品的第一页的特殊物品弹出 其他物品进来
我们先把特殊物品放进队列里面
对第一页来说 枚举和他在同一页的所有特殊物品 然后统计一下有多少个
然后拿出去多少就是下标左移的贡献值 now
模拟即可
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
typedef long long ll;
queue<ll > q;
const int MAX_N = 100025;
ll arr[MAX_N];
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
ll n,m,k,ans = 0,now = 0;
scanf("%lld%lld%lld",&n,&m,&k);
for(int i = 1;i<=m;++i) scanf("%lld",&arr[i]);
for(int i = 1;i<=m;++i) q.push(arr[i]);
while(!q.empty())
{
ll cnt = 0;
ll tmp = q.front()-now;
q.pop();
cnt++;
while(!q.empty())
{
ll tmp_ = q.front()-now;
if((tmp_-1)/k==(tmp-1)/k)
{
q.pop();
cnt++;
}
else
{
break;
}
}
now+=cnt;
ans++;
}
printf("%lld\n",ans);
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
cf573D
题意 就是n个石头堆 每个石头堆有a[i]个石头
一个人只能拿一块石头一次
然后一个人输的情况是这样 他拿石头前所有石头堆没有石头可以拿
或者他拿了一个石头后 石头堆有任意两个堆石头数目相同 那么也是输
这个题题意读错了 所以是全场失误最大的地方
题意读对以后15分钟AC
只要考虑如果相同石头堆数目>=3 或者有两个及两个以上石头堆数目相同 或者有一个相同的石头堆但是你在动他的时候会和他之前的重复 例如 2 3 3 ，还有一个是石头堆相同数目是 0 ,你显然也无法操作了。
然后去掉这些情况他们的数目肯定不同 再把他们变成 0 1 2 3 …即可
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
//#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
//#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
//#define max3(a,b,c) max(a,max(b,c))
//#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
typedef long long ll;
const int MAX_N = 100025;
ll arr[MAX_N];
set<ll> st;
map<ll ,int >mp;
priority_queue<ll> q,q_;
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n;
ll ans = 0;
scanf("%d",&n);
for(int i =1 ;i<=n;++i)
{
scanf("%lld",&arr[i]);
st.insert(arr[i]);
if(mp.find(arr[i])==mp.end()) mp[arr[i]] = 1;
else mp[arr[i]]++;
}
bool flag = true,flag_ = false;
ll ck;
for(set<ll>::iterator it = st.begin();it!=st.end();it++)
{
if(mp[*it]>=2)
{
if(flag_) flag = false,ck = *it;
else flag_ = true,ck = *it;
}
if(mp[*it]>=3) flag = false;
}
if(!flag)
{
printf("cslnb\n");
return 0;
}
else
{
if(flag_)
{
if(ck==0)
{
printf("cslnb\n");
return 0;
}
if(mp.find(ck-1)!=mp.end())
{
printf("cslnb\n");
return 0;
}
else
{
for(int i = 1;i<=n;++i ) if(arr[i]==ck)
{
ans++;
arr[i]--;
break;
}
}
}
for(int i = 1;i<=n;++i) q.push(-arr[i]);
while(!q.empty())
{
ll tmp = -q.top();
q.pop();
if(q_.empty())
{
ans+=tmp;
q_.push(1);
}
else
{
ll top = q_.top();
ans+=tmp-top;
q_.push(top+1);
}
}
// dbg(ans);
if(ans%2==0) printf("cslnb\n");
else printf("sjfnb\n");
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
CF573E
题意 有n长度的01串 你一次能把k长度的连续01串变成 0 或者 1 能把所有串变相同者赢
sjf先操作 q老师后操作 问你谁赢
首先要知道一个事情
如果sjf第一步或者不用操作就可以把串变成相同串 那么sjf肯定赢
我们怎么判呢 用两个vector 存 0 和 1 的下标 如果这两个vector有任何一个为空 那么原串肯定相同
或者不空但是最大下标减最小下标+1 <= k 那么sjf也直接赢了
然后这题还有个猜的就是 k*2<n 那么肯定是无限继续 因为哪个人快输了他就不会让对手进入必赢态
然后代码中判断q老师赢的那步flag 这样理解 给出下图
看图中第一句话怎么理解 我们发现 0 和 1的最大下标减去最小下标加 1 是 7 ，而 k 是 6
只要你 i 从 2开始 到 i+k<n 也就是左到右右到左判一下是不是分别和左右相等
第一个 2 3 和 1 ,8 9 和 10 他们颜色都是相同的 那么你无论如何怎么操作 都会使得 0 或者 1 最大下标减去最小下标+1 变小 从而q老师再操作一步就赢了
否则你就能构造出下图的那种情况 使得一串全变0的时候两边各有1 为什么能保证呢 就是for循环确定的flag确定这种情况会不会出现
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
/*namespace sgt
{
#define mid ((l+r)>>1)
#undef mid
}*/
const int MAX_N = 100025;
char str[MAX_N];
vector<int> vt,vt_;
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n,k;
scanf("%d%d",&n,&k);
scanf("%s",str+1);
for(int i = 1;i<=n;++i)
if(str[i]=='1') vt.push_back(i);
else vt_.push_back(i);
if(vt.empty()||vt_.empty()||*vt.rbegin()-*vt.begin()+1<=k||*vt_.rbegin()-*vt_.begin()+1<=k) puts("tokitsukaze");
else
{
if(k*2<n) puts("once again");
else
{
bool flag = false;
for(int i = 2 ;i+k<n;++i)
{
if(str[i]!=str[1])
flag = true;
if(str[n-i+1]!=str[n])
flag = true;
}
if(!flag) puts("quailty");
else puts("once again");
}
}
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
CF573F
题意 就是用一个上面为空的容器去装点
问你装点有多少种方案
我们先考虑按照y排序
从高往低 因为低的不会影响高的
假设大家高度都不同
对当前高度 如果他左边有 l 个 右边有 r 个
那么他的贡献是 (l+1) + (r+1) +1代表自己不选的选项 那么就很好做了
但是如果高度相同呢？
我们就得从左到右 依次取消前面的影响
也就是你query的时候要query上一个点横坐标加1 到现在这个点横坐标减1的区间
也是十分的骚了
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 200025;
const int N = 200001;
namespace sgt
{
#define mid ((l+r)>>1)
int s[MAX_N<<2];
void update(int rt,int l,int r,int x)
{
if(l==r)
{
s[rt] = 1;
return;
}
if(x<=mid) update(rt<<1,l,mid,x);
else update(rt<<1|1,mid+1,r,x);
s[rt] = s[rt<<1]+s[rt<<1|1];
}
int query(int rt,int l,int r,int x,int y)
{
if(x>y) return 0;
if(x<=l&&r<=y)
{
return s[rt];
}
if(x>mid) return query(rt<<1|1,mid+1,r,x,y);
else if(y<=mid) return query(rt<<1,l,mid,x,y);
else return query(rt<<1,l,mid,x,y)+query(rt<<1|1,mid+1,r,x,y);
}
#undef mid
}
struct node
{
int x,y;
bool operator < (const node other) const&
{
if(y==other.y) return x < other.x;
return y >other.y;
}
}arr[MAX_N];
int b[MAX_N],c[MAX_N];
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n;
scanf("%d",&n);
for(int i = 1;i<=n;++i)
scanf("%d%d",&arr[i].x,&arr[i].y),b[i] = arr[i].x,c[i] = arr[i].y;
sort(b+1,b+1+n);
sort(c+1,c+1+n);
int sz = unique(b+1,b+1+n)-b-1;
int sz_ = unique(c+1,c+1+n)-c-1;
for(int i = 1;i<=n;++i) arr[i].x = lower_bound(b+1,b+1+sz,arr[i].x)-b;
for(int i = 1;i<=n;++i) arr[i].y = lower_bound(c+1,c+1+sz_,arr[i].y)-c;
sort(arr+1,arr+1+n);
ll ans = 0;
for(int i = 1;i<=n;++i)
{
if(i!=n&&arr[i].y==arr[i+1].y)
{
sgt::update(1,1,N,arr[i].x);
int R = i+1;
while(R<=n&&arr[R].y==arr[i].y)
{
sgt::update(1,1,N,arr[R].x);
R++;
}
int l = sgt::query(1,1,N,1,arr[i].x-1);
int r = sgt::query(1,1,N,arr[i].x+1,N);
ans+=1ll*(l+1)*(r+1);
for(int j = i+1;j<R;++j)
{
int l = sgt::query(1,1,N,arr[j-1].x+1,arr[j].x-1);
int r = sgt::query(1,1,N,arr[j].x+1,N);
ans+=1ll*(l+1)*(r+1);
}
i = R-1;
}
else
{
int l = sgt::query(1,1,N,1,arr[i].x-1);
int r = sgt::query(1,1,N,arr[i].x+1,N);
ans+=1ll*(l+1)*(r+1);
sgt::update(1,1,N,arr[i].x);
}
}
printf("%lld\n",ans);
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}
116
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
