Hierarchical Notation


Time Limit: 2 Seconds      Memory Limit: 131072 KB

In Marjar University, students in College of Computer Science will learn EON (Edward Object Notation), which is a hierarchical data format that uses human-readable text to transmit data objects consisting of attribute-value pairs. The EON was invented by Edward, the headmaster of Marjar University.

The EON format is a list of key-value pairs separated by comma ",", enclosed by a couple of braces "{" and "}". Each key-value pair has the form of "<key>":"<value>". <key> is a string consists of alphabets and digits. <value> can be either a string with the same format of <key>, or a nested EON.

To retrieve the data from an EON text, we can search it by using a key. Of course, the key can be in a nested form because the value may be still an EON. In this case, we will use dot "." to separate different hierarchies of the key.

For example, here is an EON text:

{"headmaster":"Edward","students":{"student01":"Alice","student02":"Bob"}}

  • For the key "headmaster", the value is "Edward".
  • For the key "students", the value is {"student01":"Alice","student02":"Bob"}.
  • For the key "students"."student01", the value is "Alice".

As a student in Marjar University, you are doing your homework now. Please write a program to parse a line of EON and respond to several queries on the EON.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an EON text. The number of colons ":" in the string will not exceed 10000 and the length of each key and non-EON value will not exceed 20.

The next line contains an integer Q (0 <= Q <= 1000) indicating the number of queries. Then followed by Q lines, each line is a key for query. The querying keys are in correct format, but some of them may not exist in the EON text.

The length of each hierarchy of the querying keys will not exceed 20, while the total length of each querying key is not specified. It is guaranteed that the total size of input data will not exceed 10 MB.

Output

For each test case, output Q lines of values corresponding to the queries. If a key does not exist in the EON text, output "Error!" instead (without quotes).

Sample Input

1
{"hm":"Edward","stu":{"stu01":"Alice","stu02":"Bob"}}
4
"hm"
"stu"
"stu"."stu01"
"students"

Sample Output

"Edward"
{"stu01":"Alice","stu02":"Bob"}
"Alice"
Error! 题意: 牡丹江的H题, 写一个很类似python的字典的东西,然后给出键值输出对应的值,可以嵌套。ps 好喜欢python这样的自由、简洁,打完这星期国赛就专研一下python 思路: 使劲模拟一遍就ok啦,一开始tle了,看了别人题解,原来应该hash一下字符串再存入map中的,改hash后150ms就过了
#pragma comment(linker,"/STACK:1024000000,1024000000")
#include <bits/stdc++.h>
using namespace std;
const int N = ; char s[N],query[N];
int p,sz,qsz; struct _node{
int val_l,val_r;
map<string,int> mp;
void clear()
{
val_l=val_r=;
mp.clear();
}
}node[N];
int cnt; void readname(char *s,int sz,int &l,int &r)
{
l=p++;
while(p<sz && s[p]!='"')
p++;
r=p++;
// cout<<l<<' '<<r<<' '<<s[l]<<' '<<s[r]<<endl;
} void prints(int l,int r)
{
while(l<=r && l<sz) putchar(s[l++]);
puts("");
} void build(int root)
{
node[root].val_l=p++;
if(s[p]=='}') goto bk;
while(p<sz)
{
int l,r;
readname(s,sz,l,r);
string key(s,l,r-l+);
// cout<<l<<' '<<r<<' '<<root<<' '<<key<<endl;
node[root].mp[key]=cnt;
// cout<<node[root].mp[key]<<endl;
node[cnt++].clear();
p++; // :
if(s[p]=='{')
build(cnt-);
else
readname(s,sz,node[cnt-].val_l,node[cnt-].val_r);
if(s[p]=='}') break;
else p++; // ,
}
bk:
node[root].val_r=p++;
} void getans(int root,int &ansl,int &ansr)
{
int l,r;
while(true)
{
readname(query,qsz,l,r);
string str(query,l,r-l+);
if(node[root].mp.find(str)!=node[root].mp.end())
root=node[root].mp[str];
else
{
root=-;
break;
}
if(query[p]!='.') break;
p++;
}
if(root==-) ansl=ansr=-;
else ansl=node[root].val_l,ansr=node[root].val_r;
} void run()
{
// scanf("%s",s);
gets(s);
p=,sz=strlen(s);
node[].clear();
cnt=;
build();
int q;char c;
scanf("%d",&q);
scanf("%c",&c);
while(q--)
{
// scanf("%s",query);
gets(query);
qsz=strlen(query);
p=;
int l,r;
getans(,l,r);
if(l==-)
puts("Error!");
else
prints(l,r);
}
// cout<<endl;
// for(map<string,int>::iterator it=node[0].mp.begin(); it!=node[0].mp.end(); it++)
// cout<<it->first<<' '<<it->second<<endl;
} void test()
{
scanf("%s",s);
p=;
prints(,);
} int main()
{
#ifdef LOCAL
freopen("in","r",stdin);
#endif
// test();
int _;char c;
scanf("%d",&_);
scanf("%c",&c);
while(_--)
run();
return ;
}

不过还是这个大神写的比较简洁耗内存少

http://blog.csdn.net/keshuai19940722/article/details/40039745

#include <cstdio>
#include <cstring>
#include <map>
#include <vector>
#include <algorithm> using namespace std;
typedef unsigned long long ll;
typedef pair<int,int> pii; const int maxn = ;
const ll x = ; int N, Q, mv;
char op[maxn], s[maxn];
map<ll, pii> G; inline int idx(char ch) {
if (ch >= '' && ch <= '')
return ch - '';
else if (ch >= 'A' && ch <= 'Z')
return ch - 'A' + ;
else if (ch >= 'a' && ch <= 'z')
return ch - 'a' + ;
else if (ch == '.')
return ;
return ;
} void solve (ll u) {
ll tmp = u; while (s[mv] != '}') {
mv++;
if (s[mv] == '}')
return;
u = tmp; while (s[mv] != ':')
u = u * x + idx(s[mv++]); int l = ++mv; if (s[mv] == '{')
solve(u * x + 62LL);
else
while (s[mv+] != ',' && s[mv+] != '}') mv++; G[u] = make_pair(l, mv);
mv++;
}
} int main () {
int cas;
scanf("%d", &cas);
while (cas--) {
scanf("%s", s); mv = ;
G.clear();
solve(); scanf("%d", &Q);
for (int i = ; i <= Q; i++) {
scanf("%s", op); ll ret = ;
int len = strlen(op); for (int i = ; i < len; i++)
ret = ret * x + idx(op[i]); if (G.count(ret)) {
pii u = G[ret];
for (int i = u.first; i <= u.second; i++)
printf("%c", s[i]);
printf("\n");
} else
printf("Error!\n");
}
}
return ;
}

zoj3826 Hierarchical Notation (字符串模拟)的更多相关文章

  1. ZOJ 3826 Hierarchical Notation 模拟

    模拟: 语法的分析 hash一切Key建设规划,对于记录在几个地点的每个节点原始的字符串开始输出. . .. 对每一个询问沿图走就能够了. .. . Hierarchical Notation Tim ...

  2. 用字符串模拟两个大数相加——java实现

    问题: 大数相加不能直接使用基本的int类型,因为int可以表示的整数有限,不能满足大数的要求.可以使用字符串来表示大数,模拟大数相加的过程. 思路: 1.反转两个字符串,便于从低位到高位相加和最高位 ...

  3. HDU-3787(字符串模拟)

    Problem Description 给定两个整数A和B,其表示形式是:从个位开始,每三位数用逗号","隔开.现在请计算A+B的结果,并以正常形式输出.   Input 输入包含 ...

  4. 2014牡丹江——Hierarchical Notation

    problemId=5380" style="background-color:rgb(51,255,51)">题目链接 字符串模拟 const int MAXN ...

  5. HDU-1002.大数相加(字符串模拟)

    本题大意:给出两个1000位以内的大数a 和b,让你计算a + b的值. 本题思路:字符串模拟就能过,会Java的大佬应该不会点进来...... 参考代码: #include <cstdio&g ...

  6. Codeforces Round #425 (Div. 2) B. Petya and Exam(字符串模拟 水)

    题目链接:http://codeforces.com/contest/832/problem/B B. Petya and Exam time limit per test 2 seconds mem ...

  7. HDU-Digital Roots(思维+大数字符串模拟)

    The digital root of a positive integer is found by summing the digits of the integer. If the resulti ...

  8. Vigenère密码 2012年NOIP全国联赛提高组(字符串模拟)

    P1079 Vigenère 密码 题目描述 16 世纪法国外交家 Blaise de Vigenère 设计了一种多表密码加密算法――Vigenère 密 码.Vigenère 密码的加密解密算法简 ...

  9. CCF(JSON查询:40分):字符串+模拟

    JSON查询 201709-3 纯字符串模拟,考的就是耐心和细心.可惜这两样我都缺... #include<iostream> #include<cstdio> #includ ...

随机推荐

  1. 1194: [HNOI2006]潘多拉的盒子

    1194: [HNOI2006]潘多拉的盒子 Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 464  Solved: 221[Submit][Stat ...

  2. HttpClient 访问 https 出现peer can't

    package util; import java.security.cert.CertificateException; import javax.net.ssl.SSLContext;import ...

  3. Tomcat Server 配置

    Tomcat报错: The JRE could not be found. Edit the server and change the JRE location. EClipse -> win ...

  4. ubuntu中设置wireshark抓包

    安装wireshark软件后,打开进行抓包的时候会提示权限不足.原因是普通用户没有执行权限,也打不开网络端口捕捉,因为dumpcap需要root权限. 产生这种问题的原因:比如:wireshark在进 ...

  5. P5105 不强制在线的动态快速排序

    P5105 不强制在线的动态快速排序 $\bigoplus \limits_{i=2}^n (a_i^2-a_{i-1}^2) = \bigoplus \limits_{i=2}^n (a_i-a_{ ...

  6. html5/CSS3鼠标滑过图片特效插件

    在线演示 本地下载

  7. mvc Bundling 学习记录

    因为现在的项目JS引用很多,无意中看到了MVC4的Bundling,开始的时候感觉很不错,将所有的CSS,js文件压缩成一个文件处理,画面调用也很简单 于是,花了一个下午的时候研究了一下,并且通过各种 ...

  8. myeclipse 安装flex插件后变为中文 修改配置文件切换到英文界面

    解决办法: 1. cmd 敲命令进入安装目录,运行myeclipse.exe -nl en后,启动为英文 在安装目录下新建txt,改名为myeclipse.bat,将上面那行命令写入保存,再发送快捷方 ...

  9. Zookeeper原理与Curator使用

    近期打算实现一个基于Zookeeper的分布式的集群状态一致性控制, 对Zookeeper的原理不太了解, 正好学习一下, 网上找到了几篇文章, 先贴在这边, 等我熟读官方文档后, 再来补充自己的见解 ...

  10. css:before和after中的content属性

    css有一个属性叫做content.content只能使用在:after和:before之中.它用于在元素之前或者元素之后加上一些内容 就像这样: .email-address:before { co ...