codeforces Variable Shadowing 2014 NEERC Southern Subregional M 贪心策略
2014-10-25 21:08
441 查看
传送门:2014 NEERC Southern Subregional M
按要求输出所有出现重复定义情况时的错误信息
(1)每遇到一个{,就进入下一层
(2)每遇到一个字母,首先判断上面层次中是否有该字母的定义,若有则输出错误信息,然后记录下该层次并记录该点的行列位置
(3)每遇到一个},就退回上一层,然后把该层中所有的字母定义位置删去
按要求输出所有出现重复定义情况时的错误信息
(1)每遇到一个{,就进入下一层
(2)每遇到一个字母,首先判断上面层次中是否有该字母的定义,若有则输出错误信息,然后记录下该层次并记录该点的行列位置
(3)每遇到一个},就退回上一层,然后把该层中所有的字母定义位置删去
/****************************************************** * File Name: m.cpp * Author: kojimai * Create Time: 2014年10月25日 星期六 15时09分36秒 ******************************************************/ #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<iostream> #include<vector> using namespace std; vector<int> p[27]; char s[55]; int hang[26][2505],lie[26][2505]; void solve(int level) { for(int i = 0;i < 26; i++){ while(p[i].size()&&p[i][p[i].size()-1] > level)//退回上一层后删去删去底下层次中的记录 p[i].erase(p[i].begin()+p[i].size()-1); } } int main() { int n; for(int i = 0;i < 26; i++) p[i].clear(); scanf("%d",&n); getchar(); int level = 1; for(int i = 0;i < n; i++) { gets(s); int len = strlen(s); for(int j = 0;j < len; j++) { //cout<<"i = "<<i<<" j = "<<j<<" char = "<<s[j]<<endl; if(s[j] >= 'a' && s[j] <= 'z') { int now = s[j] - 'a'; if(p[now].size()&&p[now][p[now].size()-1] <= level)//上面层次中有该变量的定义,则输出错误信息 { printf("%d:%d: warning: shadowed declaration of %c, the shadowed position is %d:%d\n",i + 1,j + 1,s[j],hang[now][p[now].size()],lie[now][p[now].size()]); } p[now].push_back(level);//记录下该变量出现的最深层次 hang[now][p[now].size()] = i + 1;//记录行位置 lie[now][p[now].size()] = j + 1;//记录列位置 } else if(s[j] == '{') level++;//进去下一层 else if(s[j] == '}') { level--;//退回上一层 solve(level);//删去该层中的记录下的定义 } } } return 0; }
相关文章推荐
- Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest B题 (排序贪心)
- Codeforces 589H Tourist Guide (2015~2016 NEERC Southern Subregional H题) 树形DP
- codeforces Ilya Muromets 2014 NEERC Southern Subregional Contest F dp
- 【2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest F】【贪心+ STL-优先队列】 Gourmet and Banquet 最大活动时间
- Codeforces 730 J. Bottles DP 0-1背包- 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest
- Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest A题 (String模拟)
- D - Data Center-2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest
- 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem C. Equivalent Cards 计算几何
- 2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest F. Ilya Muromets
- 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem D. Grumpy Cat 交互题
- 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest F. Gourmet and Banquet(贪心+二分)
- 2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest D - Data Center 模拟
- 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem F. Judging Time Prediction 优先队列
- 2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest----I. Sale in GameStore
- Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest I题(模拟)
- [报告]NEERC Southern Subregional 2007解题报告
- Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest J题(BFS)
- Codeforces 2016-2017 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror)
- 2013-2014 ACM-ICPC, NEERC, Southern Subregional Contest Problem H. Password Service dp
- 2014-2015 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Preferred)