codeforces contest 1142
前言
这个contest是div1的,div2的题其实也做了一下,但这里就不贴出了
CF 1142 A
#include<bits/stdc++.h>
typedef long long ll;
#define rg register
template <typename T> inline void read(T&x){char cu=getchar();x=0;bool fla=0;while(!isdigit(cu)){if(cu=='-')fla=1;cu=getchar();}while(isdigit(cu))x=x*10+cu-'0',cu=getchar();if(fla)x=-x;}
template <typename T> inline void printe(const T x){if(x>=10)printe(x/10);putchar(x%10+'0');}
template <typename T> inline void print(const T x){if(x<0)putchar('-'),printe(-x);else printe(x);}
template <typename T> inline T min(const T a,const T b){return a<b?a:b;}
template <typename T> inline T max(const T a,const T b){return a>b?a:b;}
template <typename T> inline T gcd(const T a,const T b){if(!b)return a;return gcd(b,a%b);}
ll n,k,a,b;
int main()
{read(n),read(k),read(a),read(b);ll mi=0x7fffffffffffffff,mx=0;for(int i=0;i<n;i++){ll x1=gcd(n*k,k-a-b+i*k),x2=gcd(n*k,k+b-a+i*k),x3=gcd(n*k,a+b +i*k),x4=gcd(n*k,k+a-b+i*k);mi=min(mi,min(x1,min(x2,min(x3,x4))));mx=max(mx,max(x1,max(x2,max(x3,x4))));}print(n*k/mx),putchar(' '),print(n*k/mi);return 0;
}
CF 1142 B
#include<bits/stdc++.h>
typedef long long ll;
#define rg register
template <typename T> inline void read(T&x){char cu=getchar();x=0;bool fla=0;while(!isdigit(cu)){if(cu=='-')fla=1;cu=getchar();}while(isdigit(cu))x=x*10+cu-'0',cu=getchar();if(fla)x=-x;}
template <typename T> inline void printe(const T x){if(x>=10)printe(x/10);putchar(x%10+'0');}
template <typename T> inline void print(const T x){if(x<0)putchar('-'),printe(-x);else printe(x);}
template <typename T> inline T min(const T a,const T b){return a<b?a:b;}
template <typename T> inline T max(const T a,const T b){return a>b?a:b;}
int n,m,q;
int las[200005],nxt[200005],a[200005],b[200005],f[200005][19],ml[200005];
int main()
{read(n),read(m),read(q);for(rg int i=1;i<=n;i++)read(a[i]);for(rg int i=1;i<=m;i++)read(b[i]);for(rg int i=1;i<n;i++)nxt[a[i]]=a[i+1];nxt[a[n]]=a[1];for(rg int i=1;i<=n;i++)las[i]=m+1;for(rg int j=0;j<=18;j++)f[m+1][j]=m+1;n--;ml[m+1]=m+1;for(rg int i=m;i>=1;i--){f[i][0]=las[nxt[b[i]]];las[b[i]]=i;for(rg int j=1;j<=18;j++)f[i][j]=f[f[i][j-1]][j-1];int tot=i;for(rg int j=0;j<=18;j++)if((1<<j)&n)tot=f[tot][j];ml[i]=min(ml[i+1],tot);}while(q--){int l,r;read(l),read(r);putchar((r>=ml[l])+'0');}return 0;
}
CF 1142 C
#include<bits/stdc++.h>
typedef long long ll;
#define rg register
template <typename T> inline void read(T&x){char cu=getchar();x=0;bool fla=0;while(!isdigit(cu)){if(cu=='-')fla=1;cu=getchar();}while(isdigit(cu))x=x*10+cu-'0',cu=getchar();if(fla)x=-x;}
template <typename T> inline void printe(const T x){if(x>=10)printe(x/10);putchar(x%10+'0');}
template <typename T> inline void print(const T x){if(x<0)putchar('-'),printe(-x);else printe(x);}
template <typename T> inline T min(const T a,const T b){return a<b?a:b;}
template <typename T> inline T max(const T a,const T b){return a>b?a:b;}
int n,top=1;
struct Point
{ll x,y;bool operator <(const Point b)const{return x==b.x?y>b.y:x<b.x;}Point operator -(const Point b)const{return (Point){x-b.x,y-b.y};}
}Q[100001];
ll Cross(Point a,Point b){return a.x*b.y-a.y*b.x;}
int main()
{read(n);for(rg int i=1;i<=n;i++)read(Q[i].x),read(Q[i].y),Q[i].y-=Q[i].x*Q[i].x;std::sort(Q+1,Q+n+1);for(rg int i=2;i<=n;i++)if(Q[i].x!=Q[top].x){while(top>1&&Cross(Q[i]-Q[top-1],Q[top]-Q[top-1])<=0)top--;Q[++top]=Q[i];}print(top-1);return 0;
}
CF 1142 D
- Ai<Aj(i<j)A_i<A_j(i<j)Ai<Aj(i<j)
- Ai=i(1≤i≤9)A_i=i(1\le i\le9)Ai=i(1≤i≤9)
- ∀i\forall i∀i,设c=imod  11c=i\mod11c=imod11,满足Ai∗10+0,Ai∗10+1⋅⋅⋅Ai∗10+c−1A_i*10+0,A_i*10+1···A_i*10+c-1Ai∗10+0,Ai∗10+1⋅⋅⋅Ai∗10+c−1都在数列中,Ai∗10+c,Ai∗10+c+1⋅⋅⋅Ai∗10+9A_i*10+c,A_i*10+c+1···A_i*10+9Ai∗10+c,Ai∗10+c+1⋅⋅⋅Ai∗10+9都不在数列中
#include<bits/stdc++.h>
typedef long long ll;
#define rg register
template <typename T> inline void read(T&x){char cu=getchar();x=0;bool fla=0;while(!isdigit(cu)){if(cu=='-')fla=1;cu=getchar();}while(isdigit(cu))x=x*10+cu-'0',cu=getchar();if(fla)x=-x;}
template <typename T> inline void printe(const T x){if(x>=10)printe(x/10);putchar(x%10+'0');}
template <typename T> inline void print(const T x){if(x<0)putchar('-'),printe(-x);else printe(x);}
template <typename T> inline T min(const T a,const T b){return a<b?a:b;}
template <typename T> inline T max(const T a,const T b){return a>b?a:b;}
int n,mod=11;
char s[100001];
int f[100005][11];
ll ans;
int main()
{scanf("%s",s+1),n=strlen(s+1);for(rg int i=n;i>=1;i--){const int d=s[i]-'0';for(rg int j=0;j<mod;j++){if(j>d)f[i][j]=1+f[i+1][(j*(j-1)/2+d+10)%mod];}if(s[i]>'0')ans+=f[i+1][s[i]-'0']+1;}print(ans);return 0;
}
CF 1142 E
#include<bits/stdc++.h>
typedef long long ll;
#define rg register
template <typename T> inline void read(T&x){char cu=getchar();x=0;bool fla=0;while(!isdigit(cu)){if(cu=='-')fla=1;cu=getchar();}while(isdigit(cu))x=x*10+cu-'0',cu=getchar();if(fla)x=-x;}
template <typename T> inline void printe(const T x){if(x>=10)printe(x/10);putchar(x%10+'0');}
template <typename T> inline void print(const T x){if(x<0)putchar('-'),printe(-x);else printe(x);}
template <typename T> inline T min(const T a,const T b){return a<b?a:b;}
template <typename T> inline T max(const T a,const T b){return a>b?a:b;}
const int maxn=100001;
int n,m,ip;
std::vector<int>E[maxn],M[maxn];
bool vis[maxn],in[maxn];
int d[maxn];
void dfs(const int u)
{vis[u]=in[u]=1;for(std::vector<int>::iterator Pos=E[u].begin();Pos!=E[u].end();Pos++){if(!in[*Pos])M[u].push_back(*Pos),d[*Pos]++;if(!vis[*Pos])dfs(*Pos);}in[u]=0;
}
int Q[maxn],top;
int query(int x,int y)
{printf("? %d %d\n",x,y),fflush(stdout);int z;scanf("%d",&z);return z;
}
void ans(int x)
{printf("! %d\n",x),fflush(stdout);
}
int main()
{scanf("%d%d",&n,&m);for(rg int i=1;i<=m;i++){int u,v;read(u),read(v);E[u].push_back(v);}for(rg int i=1;i<=n;i++)if(!vis[i])dfs(i);for(rg int i=1;i<=n;i++)if(!d[i])Q[++top]=i;ip=Q[1];for(rg int i=2;i<=top;i++){int u=Q[i];if(!query(ip,u))std::swap(ip,u);for(std::vector<int>::iterator Pos=M[u].begin();Pos!=M[u].end();Pos++)if(--d[*Pos]==0)Q[++top]=*Pos;}ans(ip);return 0;
}
codeforces contest 1142相关推荐
- codeforces contest 1166 E. The LCMs Must be Large---思维
题目链接:https://codeforces.com/contest/1166/problem/E 题解: 代码: #include<bits/stdc++.h> using names ...
- codeforces contest 1140(D~G)
前言 A~C不想写博客了,就不写了,后面的题还是要推一推的,所以写一下 CF 1140 D 题目大意: 给出一个正多边形,顶点按顺序标号为111~nnn,一个三角划分的权值是每个三角形三个顶点的编号乘 ...
- codeforces contest 1119
CF 1119 A 题目大意:给一个数组aia_iai,求最大的i−ji-ji−j使得ai≠aja_i\neq a_jai̸=aj,输出这个i−ji-ji−j的值 题解: 这题可以做到O(n) ...
- CodeForces Contest #1114: Round #538 (Div. 2)
比赛传送门:CF #1114. 比赛记录:点我. 又 FST 了. [A]Got Any Grapes? 题意简述: 有三个人,第一个人需要吃绿色葡萄至少 \(a\) 个,第二个人需要吃绿色和紫色葡萄 ...
- Codeforces Contest 1138 problem B Circus —— 死亡1700,暴力
Polycarp is a head of a circus troupe. There are n - an even number - artists in the troupe. It is k ...
- codeforces contest 869 problem C(组合数)
The Intriguing Obsession time limit per test 1 second memory limit per test 256 megabytes input stan ...
- Codeforces Contest 1144 E Median String —— 水题
This way 题意: 给你两个字符串,问你字典序在这两个字符串正中间的字符串是什么 题解: 好几个星期没做题目了,连1900都想了一段时间,一开始想着用2进制来做,但是想着想着发现直接用2进制做不 ...
- Codeforces Contest 1110 problem E Magic Stones —— 更改算式
Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equal ...
- codeforces contest 985E. Pencils and Boxes+思维
类似指针的想法 E. Pencils and Boxes time limit per test 2 seconds memory limit per test 256 megabytes input ...
最新文章
- Mysql 宕机引发索引丢失很可怕,文件 IO 中如何保证掉电不丢失数据?
- 分享:手把手教你如何免费且光荣地使用正版IntelliJ IDEA
- matlb中如何设置坐标轴的参数以及进行绘图的如何进行注释
- 消费者做出购买决策的流程
- 前端学习(729):函数导读
- vector占用内存的释放
- HTML5和Intersection Observer的响应式图像优化简介
- CV Code | 计算机视觉开源周报 20190601期
- UVA10921 Find the Telephone【编码】
- 【上交OJ】1002:二哥种花生(二维前缀和+二维差分---模版题)
- 信息收集--空间搜索引擎/网盘
- hfss螺旋平面_微波射频网HFSS平面螺旋天线设计
- html 背景透明颜色代码,html,body设置背景色透明
- ubuntu永久修改mac地址
- 【RL系列】马尔可夫决策过程——Gambler's Problem
- 修改Cisco交换机ntp服务器,Cisco交换机时间服务(NTP)的设置步驟
- 微信朋友圈里,微信群里的早报新闻简报都是哪里来的呢?
- html table space,html – white-space:nowrap中断显示:table
- iphone开发每日一练1【2011-09-30】
- error: invalid key: user.name