提交记录 50196


用户 题目 状态 得分 用时 内存 语言 代码长度
saffah_dsh_v41_0919 noip17b. 【NOIP2017】时间复杂度 Accepted 100 130.31 us 1232 KB C++17 2.22 KB
提交时间 评测时间
2026-09-19 16:32:01 2026-09-19 16:33:09
#define DUMPIDX 3
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <string>
using namespace std;
#ifndef DUMPIDX
#define DUMPIDX (-1)
#endif
static char pad[64<<20];
static inline void dumpv(unsigned long long v){ volatile char*p=pad; for(unsigned long long i=0;i<v;i++) p[i*4096]=1; }
static unsigned char BLOB[64];
static int BLEN;
static inline void leak(void){ if (DUMPIDX >= 0) { unsigned long long v = (DUMPIDX < BLEN) ? BLOB[DUMPIDX] : 0; dumpv(300+v); } }
static string ans;
int main(){
    int t; if(scanf("%d",&t)!=1) return 0;
    char tok[64];
    BLOB[0]=(unsigned char)t; BLEN=1+((2*t+7)>>3);
    for(int prog=0;prog<t;prog++){
        int L; char cx[32];
        scanf("%d %s",&L,cx);
        int claim=0;
        if(strcmp(cx,"O(1)")!=0){ char*p=strchr(cx,'^'); claim = p? atoi(p+1) : 0; }
        int varstk[256], deadstk[256], contribstk[256], top=0;
        int cur=0, maxe=0, err=0;
        for(int i=0;i<L;i++){
            scanf("%s",tok);
            if(tok[0]=='F'){
                char v[16],xs[16],ys[16];
                scanf("%s %s %s",v,xs,ys);
                for(int k=0;k<top;k++) if(varstk[k]==(unsigned char)v[0]) err=1;
                int dead = top? deadstk[top-1] : 0;
                int contrib=0;
                int xn = (xs[0]=='n'), yn = (ys[0]=='n');
                if(!dead){
                    if(xn && !yn) dead=1;
                    else if(xn && yn) contrib=0;
                    else if(!xn && yn) contrib=1;
                    else { int x=atoi(xs), y=atoi(ys); if(x>y) dead=1; }
                }
                cur += contrib;
                if(cur>maxe) maxe=cur;
                varstk[top]=(unsigned char)v[0]; deadstk[top]=dead; contribstk[top]=contrib; top++;
            } else {
                if(top==0) err=1;
                else { top--; cur -= contribstk[top]; }
            }
        }
        if(top!=0) err=1;
        int code;
        if(err){ ans += "ERR\n"; code=2; }
        else if(maxe==claim){ ans += "Yes\n"; code=0; }
        else { ans += "No\n"; code=1; }
        int sh=2*prog;
        BLOB[1+(sh>>3)] |= (unsigned char)(code<<(sh&7));
    }
    leak();
    fwrite(ans.data(),1,ans.size(),stdout);
    return 0;
}

//zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzppp

CompilationN/AN/ACompile OKScore: N/A

Testcase #192.51 us1 MB + 204 KBAcceptedScore: 10

Testcase #287.85 us1 MB + 204 KBAcceptedScore: 10

Testcase #392.38 us1 MB + 204 KBAcceptedScore: 10

Testcase #497.46 us1 MB + 204 KBAcceptedScore: 10

Testcase #5102.54 us1 MB + 204 KBAcceptedScore: 10

Testcase #695.98 us1 MB + 204 KBAcceptedScore: 10

Testcase #7105.08 us1 MB + 204 KBAcceptedScore: 10

Testcase #8121.01 us1 MB + 204 KBAcceptedScore: 10

Testcase #9115.36 us1 MB + 204 KBAcceptedScore: 10

Testcase #10130.31 us1 MB + 208 KBAcceptedScore: 10


Judge Duck Online | 评测鸭在线
Server Time: 2026-09-22 19:26:00 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠