新千题计划 9#：[NOIP17] 时间复杂度

最新推荐文章于 2024-07-04 19:32:46 发布

「已注销」

最新推荐文章于 2024-07-04 19:32:46 发布

阅读量163

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/qq_19982679/article/details/82892015

版权

模拟专栏收录该内容

2 篇文章 0 订阅

订阅专栏

时间复杂度给出若干个循环语句嵌套关系及其时间复杂度，判断是否具有语法错误，若无，给出的时间复杂度是否正确。

模拟。 纯粹模拟，思路简单，就不说明了。读入整行和边读边处理各有千秋。

#include <cstdio>
#include <cstring>
#include <cctype>
#include <algorithm>
#include <stack>
#define Max(u, v) ((v) < (u)? u: v)
const int MAXL = 101;
int t; bool vis[26]; char nil[MAXL];

struct Bnd { int f, s; char t; inline int ly() { return f? f + s - 1: 0; }
  Bnd(int f = 0, int s = 0, char t = '\0'): f(f), s(s), t(t) {}};
std::stack<Bnd> zhan;

struct Read {
  Read& operator >>(char& ip) {
    do ip = getchar(); while(!isalpha(ip)); return *this; }
  Read& operator >>(int&  re) {
    char ip; re = 0; do ip = getchar(); while(!isgraph(ip));
    if(!isdigit(ip)) { re = -1; return *this; }
    else do re = (re << 3) + (re << 1) - '0' + ip;
    while(isdigit(ip = getchar())); return *this; }} myin;

int main() {
  scanf("%d", &t); while(t--) {
    int l, an; bool flg = true; char ans[MAXL], ta[MAXL];
    scanf("%d%s", &l, ans); memset(vis, 0, sizeof vis);
    while(!zhan.empty()) zhan.pop(); zhan.push(Bnd(1));
    for(int i = 0; i < l; i++) {
      char ip; int x, y; myin >> ip;
      if(ip == 'F') { myin >> ip; if(vis[ip - 'a']) flg = false; 
        vis[ip - 'a'] = true; myin >> x >> y;
        zhan.push(Bnd(x != y? (~y && x > y) || !~x? 0: !~y? 2: 1: 1, 0, ip)); }
      else { Bnd top; if(zhan.size() < 2) { flg = false; continue; } 
        top = zhan.top(); vis[top.t - 'a'] = false;
        zhan.pop(); zhan.top().s = std::max(zhan.top().s, top.ly()); }}
    if(zhan.size() != 1) flg = false;
    else an = zhan.top().ly(), sprintf(ta,  "O(n^%d)", an);
    puts(flg? !an? strcmp(ans, "O(1)")? "No": "Yes":
      strcmp(ans, ta)? "No": "Yes": "ERR"); }
  return 0; }