CF 342B(Xenia and Spies-模拟)
来源:互联网 发布:java打印所有ASCII码 编辑:程序博客网 时间:2024/05/16 23:02
模拟注意细节
一开始因为考虑下一个传的 s+1 没考虑反向囧。。。
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<functional>#include<iostream>#include<cmath>#include<cctype>#include<ctime>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++)#define ForD(i,n) for(int i=n;i;i--)#define RepD(i,n) for(int i=n;i>=0;i--)#define Forp(x) for(int p=pre[x];p;p=next[p])#define Lson (x<<1)#define Rson ((x<<1)+1)#define MEM(a) memset(a,0,sizeof(a));#define MEMI(a) memset(a,127,sizeof(a));#define MEMi(a) memset(a,128,sizeof(a));#define INF (2139062143)#define F (100000007)#define MAXN (100000+10)long long mul(long long a,long long b){return (a*b)%F;}long long add(long long a,long long b){return (a+b)%F;}long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}typedef long long ll;int n,m,s,f,t[MAXN],l[MAXN],r[MAXN];int main(){//freopen("Spies.in","r",stdin);//freopen(".out","w",stdout);cin>>n>>m>>s>>f;For(i,m) cin>>t[i]>>l[i]>>r[i];int nowt=1,i=1,dire;if (s<f) dire=1;else dire=-1;while (s^f){if (nowt==t[i]){if ((l[i]<=s&&s<=r[i])||(l[i]<=s+dire&&s+dire<=r[i])) {printf("X");nowt++;i++;continue;}i++;}if (dire==1) printf("R");else printf("L");;s+=dire;nowt++;}puts("");return 0;}
- CF 342B(Xenia and Spies-模拟)
- cf 342B - Xenia and Spies(贪心)
- CodeForces 342B Xenia and Spies
- CodeForces 342B Xenia and Spies(贪心)
- Codeforces Round #199 (Div. 2) -- B. Xenia and Spies (简单模拟)
- Xenia and Spies
- Codeforces Round #199 (Div. 2) B. Xenia and Spies
- Codeforces Round #199(Div. 2) B. Xenia and Spies
- CF#196DIV2:B-Xenia and Ringroad
- Codeforces Round #199 (Div. 2) B. Xenia and Spies(贪心)
- CF 342E Xenia and Tree(分块)
- B. Xenia and Ringroad
- cf 356 - Xenia and Hamming
- CF 342A(Xenia and Divisors-考虑有限情况)
- CF 342A Xenia and Divisors (数学规律)
- CF 342A Xenia and Divisors (数学规律)
- CF#196:DIV2:C-Xenia and Weights
- cf 324e Xenia and Tree
- Android之场景桌面(二)----模拟时钟实现
- 数组A中,除了某一个数字x之外,其他数字都出现了三次,而x出现了一次。请给出最快的方法,找到x。
- MFC为何使用消息映射表而不用虚函数?
- 机房收费系统Number One
- C#窗口切换问题的解决
- CF 342B(Xenia and Spies-模拟)
- HP450 MAC
- 百万级PHP网站架构工具箱
- SGU155(笛卡尔树的构造)
- CF 342C(Cupboard and Balloons-难得对的贪心)
- CodeForces #199Div.2-A.Xenia and Divisors
- jquery UI拖拽功能(好文收藏,并且做过一遍了。)
- (转)GDAL库调试(包括跨语言调试)
- 线程相关的