hihocoder #1341 Constraint Checker
描述
Given a set of constraints like 0<N<=M<=100 and values for all the variables, write a checker program to determine if the constraints are satisfied.
More precisely, the format of constraints is:
token op token op ... op token
where each token is either a constant integer or a variable represented by a capital letter and each op is either less-than ( < ) or less-than-or-equal-to ( <= ).
输入
The first line contains an integer N, the number of constraints. (1 ≤ N ≤ 20)
Each of the following N lines contains a constraint in the previous mentioned format.
Then follows an integer T, the number of assignments to check. (1 ≤ T ≤ 50)
Each assignment occupies K lines where K is the number of variables in the constraints.
Each line contains a capital letter and an integer, representing a variable and its value.
It is guaranteed that:
1. Every token in the constraints is either an integer from 0 to 1000000 or an variable represented by a capital letter from 'A' to 'Z'.
2. There is no space in the constraints.
3. In each assignment every variable appears exactly once and its value is from 0 to 1000000.
输出
For each assignment output Yes or No indicating if the constraints are satisfied.
- 样例输入
2
A<B<=E
3<=E<5
2
A 1
B 2
E 3
A 3
B 5
E 10 样例输出
Yes
No
比较简单的字符串处理题。写这篇是要记录下C++的istream类的用法。
朴素实现:
#include <bits/stdc++.h>
using namespace std; map<char,int> mp; string c[];
bool used[]; bool ok(int a, string &op, int b){
if(op=="<") return a<b;
return a<=b;
} int get_val(string &s, int &i){
int res=;
for(; s[i] && isdigit(s[i]) && !isalpha(s[i]); res*=, res+=s[i++]-'');
if(isalpha(s[i])) res=mp[s[i++]];
return res;
} string get_op(string &s, int &i){
string res;
for(; s[i] && ispunct(s[i]); res+=s[i++]);
return res;
} bool check(int n){
int a, b;
string op;
for(int i=; i<n; i++){
int j=;
a=get_val(c[i], j);
for(;;){
op=get_op(c[i], j);
if(op=="") break;
b=get_val(c[i], j);
if(!ok(a, op, b)) return false;
a=b;
}
}
return true;
} int main(){
int n, T;
cin>>n;
for(int i=; i<n; i++){
cin>>c[i];
for(auto x:c[i])
if(isalpha(x)) used[x-'A']=true;
}
int nv=;
for(int i=; i<; i++) nv+=used[i]; for(cin>>T; T--; ){
for(int i=; i<nv; i++){
char x;
int v;
cin>>x>>v;
mp[x]=v;
}
puts(check(n)?"Yes":"No");
}
}
借助stringstream类的实现:
#include <bits/stdc++.h>
using namespace std; map<char,int> mp; string c[];
bool used[]; int get_val(stringstream &x){
int res;
char v;
x>>res;
if(x.fail()){ //check whether badbit or failbit is set
//When an istream object turns fail, it stops working until flags reset
x.clear(); //new
x.get(v), res=mp[v];
}
return res;
} string get_op(stringstream &x){
char v;
string res;
if(x.str().empty()) return res;
for(;;){
x.get(v);
if(ispunct(v)) res+=v;
else{
x.putback(v);
return res;
}
}
} bool ok(int a, string &op, int b){
if(op=="<") return a<b;
return a<=b;
} bool check(int n){
int a, b;
string op;
stringstream x;
for(int i=; i<n; i++){
x.str(c[i]);
x.clear(); //error-prone, new
a=get_val(x);
for(;;){
op=get_op(x);
if(op=="") break;
b=get_val(x);
if(!ok(a, op, b)) return false;
a=b;
}
}
return true;
} // Input stream objects can read and interpret input from sequences of characters.
// Specific members are provided to perform
// these input operations. The standard object cin is an object of this type. int main(){
int n, T;
cin>>n;
for(int i=; i<n; i++){
cin>>c[i];
for(auto x:c[i])
if(isalpha(x)) used[x-'A']=true;
}
int nv=;
for(int i=; i<; i++) nv+=used[i]; for(cin>>T; T--; ){
for(int i=; i<nv; i++){
char x;
int v;
cin>>x>>v;
mp[x]=v;
}
puts(check(n)?"Yes":"No");
}
}
这里系统介绍一下C++的Stream I/O. (以下内容来自 The C++ Programming Language 4th Ed. by Bjarne Stroustrup, 38 I/O Streams).
- The I/O stream library provides formatted and unformatted buffered I/O of text and numeric values. The definitions for I/O stream facilities are found in <istream>, <ostream>, etc.;
- An istream converts a stream of characters (bytes) to typed objects:
Byte sequences --> stream buffer --> istream --> typed values
An iostream is a stream that can act as both an istream and an ostream. You need stream buffers (streambufs) to define a mapping from an iostream to a new kind of device, file, or provide a new locale, you need a copy of the standard, a good systems manual, and examples of working code in addition to what is presented here.
The key components of the stream I/O system can be represented graphically like this:
ios_base: |-------------------------------------->|---------------------------------->locale: format information
locale independent format state | |
^ |------> basic_streambuf<>: --------------------------------> real destination/source:
I | buffering |
I | |
basic_ios<>: ------------------------------------| |--------------------------------> character buffer
locale dependent format state
stream state
^
|
|
basic_iostream<>:
formatting (<<, >>, etc.)
setup/cleanup
The vertical arrows represent "derived from." The horizontal arrows represent "pointer to." The classes marked with <> are templates parameterized by a character type and containing a locale.
38.3 Error Handling
An iostream can be in one of four states, defined in basic_ios from <ios>:
Stream States
good() The previous iostream operations succeeded
eof() We hit end-of-input ("end-of-file")
fail() Something unexpected hapened (e.g., we looked for a digit and found 'x')
bad() Something unexpected and serious happened (e.g., disk read error)
Any operation attempted on a stream that is not in the good() state has no effect; it is a no-op. An iostream can be used as a condition. In that case, the condition is true (succeeds) if the state of the iostream is good().
38.4.4 Stream State
In <ios>, the standard library defines the base class ios_base defining most of the interface to a stream class.
The basic_ios class manages the state of a stream:
- The mapping between a stream and its buffers
- The formatting options
- The use of locales
- Error handling
- Connections to other streams and stdio
It might be the most complicated class in the standard library.
ios_base Stream State iostate Member Constants
badbit Something unexpected and serious happened (e.g., a disk read error)
failbit Something unexpected hppened (e.g., we looked for a digit and found 'x')
eofbit We hit end-of-input (e.g., end-of-file)
goodbit All is well
Functions for reading these bits (good(), fail(), etc.) in a stream are provided by basic_ios.
hihocoder #1341 Constraint Checker的更多相关文章
- hihocoder 1341 Constraint Checker【string】
hihocoder 1341 解释:这道题题目还是比较容易理解,就是根据输入的若干个不等式,校验后面输入的数据是否都满足前面的不等式,满足就输出Yes,只要有一个不满足就输出No.如“A<B&l ...
- 异常:java.lang.LinkageError: loader constraint violation: when resolving interface method
异常:java.lang.LinkageError: loader constraint violation: when resolving interface method "javax. ...
- hihocoder -1121-二分图的判定
hihocoder -1121-二分图的判定 1121 : 二分图一•二分图判定 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 大家好,我是小Hi和小Ho的小伙伴Net ...
- Hihocoder 太阁最新面经算法竞赛18
Hihocoder 太阁最新面经算法竞赛18 source: https://hihocoder.com/contest/hihointerview27/problems 题目1 : Big Plus ...
- hihoCoder太阁最新面经算法竞赛15
hihoCoder太阁最新面经算法竞赛15 Link: http://hihocoder.com/contest/hihointerview24 题目1 : Boarding Passes 时间限制: ...
- 【hihoCoder 1454】【hiho挑战赛25】【坑】Rikka with Tree II
http://hihocoder.com/problemset/problem/1454 调了好长时间,谜之WA... 等我以后学好dp再来看为什么吧,先弃坑(╯‵□′)╯︵┻━┻ #include& ...
- 【hihocoder#1413】Rikka with String 后缀自动机 + 差分
搞了一上午+接近一下午这个题,然后被屠了个稀烂,默默仰慕一晚上学会SAM的以及半天4道SAM的hxy大爷. 题目链接:http://hihocoder.com/problemset/problem/1 ...
- 【hihoCoder】1148:2月29日
问题:http://hihocoder.com/problemset/problem/1148 给定两个日期,计算这两个日期之间有多少个2月29日(包括起始日期). 思路: 1. 将问题转换成求两个日 ...
- 【hihoCoder】1288 : Font Size
题目:http://hihocoder.com/problemset/problem/1288 手机屏幕大小为 W(宽) * H(长),一篇文章有N段,每段有ai个字,要求使得该文章占用的页数不超过P ...
随机推荐
- Bootstrap系列 -- 7. 列表排版方式
一. 去点列表 1. 使用class=list-unstyled <ul > <li>无序列表项目</li> <li>无序列表项目</li> ...
- nios II--实验3——led 100M软件部分
软件开发 参照实验二(led),该实验与实验二(led)的不同之处在于系统的时钟由50M提成为100M.运行结果,在调试窗口输出Hello from Nios II!,并且板上的四个LED灯流动显示, ...
- 2016 5.03开始记录我的it学习。
好多谢立成师兄给我这个网址,我发现博客园不仅仅可以随笔记载很多东西,还是一个资源丰富的网站,接下来的四年我会用心去记录这些学习的点滴.
- 网页倒计时,动态显示"××年还剩××天××时××分××秒"
var target = document.getElementById('target'); function getTimeString(){ // 要计算任意两个日期的时间差只要修改curren ...
- 【JQuery】jQuery.inArray 确定第一个参数在数组中的位置
函数:jQuery.inArray(value,array,[fromIndex]) 解释: value:用于在数组中查找是否存在 array:待处理数组. ...
- C# 对sharepoint 列表的一些基本操作,包括添加/删除/查询/上传文件给sharepoint list添加数据
转载:http://www.cnblogs.com/kivenhou/archive/2013/02/22/2921954.html 操作List前请设置SPWeb的allowUnsafeUpdate ...
- dblink连接的目标端 session不断的问题。
来源于:http://blog.itpub.net/22782896/viewspace-676842/ 1.在使用了dblink的存储过程中,可以显示的手动关闭dblink连接,具体写法如下(测试存 ...
- What is GSLB
Global Server Load Balancing 中文:全局负载均衡 SLB(Server load balancing)是对集群内物理主机的负载均衡,而GSLB是对物理集群的负载均衡.这里的 ...
- 转 ext文件系统及块组
一.文件系统概述 1. 引导块 前文中介绍过磁盘需要进行分区和格式化,才能创建文件系统并使用,那么一块已经被各式化了分区其结构是什么样的呢?分区是按照柱面来划分的,而柱面包含的是磁道,磁道上包含的是扇 ...
- Java自己实现双向链表LinkList
/** * <p> * Node 双向链表实体类 * <p> * * @author <a href="mailto:yangkj@corp.21cn.com& ...