QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#325143#5615. Two Charts Become Oneweilaifuture#RE 2ms8268kbC++141.3kb2024-02-11 04:55:422024-02-11 04:55:42

Judging History

你现在查看的是最新测评结果

  • [2024-02-11 04:55:42]
  • 评测
  • 测评结果:RE
  • 用时:2ms
  • 内存:8268kb
  • [2024-02-11 04:55:42]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N = 100005;
int tp,x,st[N];
string s1,s2;
vector<int> e1[N],e2[N];
int main(){
    getline(cin,s1); getline(cin,s2); s1 = "(" + s1 + ")"; s2 = "(" + s2 + ")";
    for(char nw: s1){
        if(nw<='9'&&nw>='0'){x=x*10+nw-'0'; continue;}
        if(x&& tp>=0) e1[st[tp]].push_back(x),st[++tp] = x, x=0;
        if(nw==')') tp--;
    }
    for(char nw: s2){
        if(nw<='9'&&nw>='0'){x=x*10+nw-'0'; continue;}
        if(x && tp>=0) e2[st[tp]].push_back(x),st[++tp] = x, x=0;
        if(nw==')') tp--;
    }
    // for(int i=1;i<=100000;i++){
    //     if(e1[i].size()==0) continue; sort(e1[i].begin(), e1[i].end()); 
    //     cout<<i<<": "; for(int j=0;j<e1[i].size();j++) cout<<e1[i][j]<<" "; cout<<endl;
    // }
    // for(int i=1;i<=100000;i++){
    //     if(e2[i].size()==0) continue; sort(e2[i].begin(), e2[i].end());
    //     cout<<i<<": "; for(int j=0;j<e2[i].size();j++) cout<<e2[i][j]<<" "; cout<<endl;
    // }
    for(int i=1;i<=100000;i++){
        if(e1[i].size()!=e2[i].size()){cout<<"No"; return 0;}
        sort(e1[i].begin(), e1[i].end()); sort(e2[i].begin(), e2[i].end());
        for(int j=0;j<e1[i].size();j++) if(e1[i][j]!=e2[i][j]){cout<<"No"; return 0;}
    }
    cout<<"Yes";
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 2ms
memory: 8260kb

input:

11 (10) (12 (13) (17) (28))
11 (12 (17) (28) (13)) (10)

output:

Yes

result:

ok single line: 'Yes'

Test #2:

score: 0
Accepted
time: 1ms
memory: 8268kb

input:

11 ( 10 ) ( 12 )
11(10(12))

output:

No

result:

ok single line: 'No'

Test #3:

score: 0
Accepted
time: 1ms
memory: 8216kb

input:

11 (10) (12)
11 (10) (13)

output:

No

result:

ok single line: 'No'

Test #4:

score: -100
Runtime Error

input:

289384 (694459 (751708 (887544 (519034 (207488 (373389 ) (912072 ) (191461 ) (91909 ) (5562 ) (705802 ) (469815 ) (726477 ) ) (204098 (530445 ) (655063 ) (156343 ) (980456 ) (186944 ) (198850 ) ) ) (502461 (427161 (615081 ) (801892 ) (594639 ) (786804 ) (811554 ) (810699 ) (935475 ) (717636 ) ) (537...

output:


result: