QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#404794#6750. CalculateLance#AC ✓1ms3776kbC++141.6kb2024-05-04 18:44:112024-05-04 18:44:13

Judging History

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

  • [2024-05-04 18:44:13]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3776kb
  • [2024-05-04 18:44:11]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
using ll=long long;
using ull=unsigned long long;
#define pi pair<int, int>
#ifdef LOCAL
#include"D:/Administrator/Documents/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif

//const int N = 2e5 //Lance老师注意改一下数据范围
const int INF = 2e9 + 1000;
const ll INFLL = 8e18 + 1000;
mt19937 mrand(random_device{}());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve(){
    string s;
    ll ans=0;
    bool sign=false,flag=false;
    stack<bool> st;
    st.push(false);
    cin>>s;
    for(int i=0;i<(int)s.size();i++){
        if(s[i]>='0'&&s[i]<='9'){
            //cout<<(sign^st.top())<<endl;
            ans+=(sign^st.top()?-(s[i]-'0'):s[i]-'0');
        }else if(s[i]=='?'){
            //cout<<(sign^st.top())<<endl;
            ans+=(sign^st.top()?0:9);
        }else if(s[i]=='+'){
            sign=false;
        }else if(s[i]=='-'){
            sign=true;
        }else if(s[i]=='('){
            st.push(sign^st.top());
            sign=false;
        }else if(s[i]==')'){
            st.pop();
        }
        //cout<<'['<<s[i]<<(sign^st.top())<<']';
    }
    //cout<<endl;
    cout<<ans;
}
signed main(){
#ifndef LOCAL
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifdef LOCAL
    freopen("D:/Administrator/Documents/vscode/in.txt","r",stdin);
    freopen("D:/Administrator/Documents/vscode/out.txt","w",stdout);
#endif
    int T = 1;
    //cin >> T;
    while(T--) solve();
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3540kb

input:

?+?

output:

18

result:

ok 1 number(s): "18"

Test #2:

score: 0
Accepted
time: 0ms
memory: 3492kb

input:

(?+9)-(?+1)

output:

17

result:

ok 1 number(s): "17"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3740kb

input:

((9)-(((8)-(2))+(((1+(1))-(1+((2)+2+2)))+(5)+4))+(((7)-((9)+3))-((8)-(0-(2))+0))+((6)-(6+(((4)-(9))-(8-((9)+(1))+(0)))+(2-((9)+7))-(1)))-((((7)+(1))-((3)+(3)))-((2)-((6)-((3)-(8)))))+(2+0-((6)-(1))))-((((3)-(((0)+((4)-(9))+((6+8)+4)+(5)-(4-(3)-(8)))-((8)-(2))))+(((2)-(4))+(6)-(2))+(6-(1))-((2+9)-(3+...

output:

-63

result:

ok 1 number(s): "-63"

Test #4:

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

input:

(((((4)-((5)+(1))-(6-(8-(1))+((0)+(9))))+((2-(2))+(3+3-(((7)-(6))-(3))+(((3)+((5)-((0)-(6-(0)))))+((0)+((0)-(7)))+1-((3)-((8)-(8)))))))-(((((5-(3)-((((8)+0)+(9)-((7)-(9)))-(7)))+(2))+8+((4)-(6)+((5)-((7)+(2))))-(8-((7)+(3)+(9))))-(((9-(9-(8)))+1-((((4)+(9))+(8))+(2+(7)+3)))+((((6)+(2))-(1)-((((6+7-(...

output:

356

result:

ok 1 number(s): "356"

Test #5:

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

input:

((((((0+(5))+6)-((4)+(((7)+2)+6)-((((7)-(9))-(1))-((8-(2))+(5))-(2-((5)-(8))))-(3)))+((8)-(6)+3))+(7-(((4)+(6))+(((6)-(4))-(5))-(5-(4))-(5)+(2-(2)))+(6+(3+(2)+(7)+3)))+(((3)+(4)+(7)-(6-(5)))-((9+(8))+((1)-(0)))+((((8)+1)-(4))+(4))+(((4)-(4))+9+(((8)+3)-(6)+5)))-(((((5)+(9))-((3)-(0)))+((((0)+3)-(2))...

output:

-185

result:

ok 1 number(s): "-185"

Test #6:

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

input:

((((1-(4-(9)+((5)+(5)))+(((6)-(6)+((2)-(6)))-((7)+6)-(3)))-(2-((((7)+(8+(6)))-(5)+(7-((2)-(8)))+(4)-(((8)-(1))+(1)))-((3-(5)+(2-(1)))+2+(5)-(4))-(7)))+(9-(9+5)-(7)-((6)-(4)))+(((1+6)+(6+0-(9))+(((9+((2)+((1)-(5)))-(1))-(1))-(3+8-(2))))-((4)+((7)-(7))-(((2)-(6))+3)-((2-(3))+(4)-((0)-(1+(7)))+((0)+2))...

output:

-20

result:

ok 1 number(s): "-20"

Test #7:

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

input:

(((0-(((6)+(2))+4-(4)-(2))-((8)+4+(2))+2+(1+(9))+((2+(3))+(((8-(6))-(9))+(6)-((4)+0))-((7)-(3)-((3)+((3)+6-(2)))-(4))))-(((6)-((5)-(5-((9)+1-(6)))))+8)+(((8+(5)-(1))-(5))+(7-(0)-(0))+(((3)+(2)+(6)+0+(7)+(7)+(0+0-((1)+3)))-(((5+(8))-(9))-(8-((4)+9+(2)-(6-(6)-(4+5)))))+(2)-((((2)+1)+(0)+(3))+2))))-(((...

output:

200

result:

ok 1 number(s): "200"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3524kb

input:

(8)+((7)+4)+(3)-(((3-(0)+(3+4)+(6-(6)+(7-((8+(8))-(7)+((5)-(6+2)))))-((8+(4))+((0)-((4)-(6)+(4)+((7+9)+(5+4-(5))))-(8))))-((5)+((2)-(6))+(5)))+(8+(((3)-(8))-(7)+(7-(0+(4-(1))-((7)+(0)+((7)-(1)))))))+(7-(5))+((((((2-(((3)+1)+(((2)+(5))+4)))+(((5)+4-(6))+(((2)+(2))-(4)-(4-(9))+((0)+(1))))+9-(8)+((6)+(...

output:

-24

result:

ok 1 number(s): "-24"

Test #9:

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

input:

(((9-(4-(9-(1)))+((8)-(1))+(5-(3+2)))+(((((((1)+0)+9)-(8))+(6-(4)-(0)))-(2+((((6)-(6)-(8))-((5)-(6)))-((7)+(1)))))+(((1-(8)+(9-((7)-(1)))+(0)-((4)-(0)))+1+(9)-((((6)-(1))-(7))-(6+3+8))-((1)+(1)-(9-(9))+8-(((9)-(5))+3-(9))+(3-((8)-(3))))+(3)-(0)-(2-(2-(8)))-(5+7)+(4)+(5)+(8+((6)-(2))+(3-(8))))-((0)-(...

output:

-69

result:

ok 1 number(s): "-69"

Test #10:

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

input:

((((((2+(((9)+(9))-(5)))+(0))+((2)-(5+8)-((((3)+(4))+9+((5-(((6)+(9))-(6)))-((8)+0)+(6)))+((4-(7))+(4)+(5-(1))+(4)-(4)+4))))-(((9)+((2)-(9))-(1)-(0-(3)+1))+(5)-((6-((9)+8))-(6-(4)))-(6))-(((((7)+8)-((3)+(0)-(1)-(((2)-(1))-(5))))+((2+(0))-((8)-((4)-(6))-((5)-(2))+(7))))-((8)-(9)-((8+(0-(0-(4)))+5)+(5...

output:

40

result:

ok 1 number(s): "40"

Test #11:

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

input:

(((((((0)-(0))-((((5)-((0)-(0)))+(((1)-(7+6))-((5)+0)))+3+7))-((4+4)-(6)-(9-(3+(1)))))-((((0)-(9)-(2))-((1-(2))-(5-(?))-((6)+(0)-(0))-(8+(9-(2)))))+(((7+4+(0)-((9)+8+(0+3+0)))-(2-(8+0)))-(0))))+(((((9)-(9))+((3+3+4)+(1)+(6)+((1)-(5))))-(3)-((6)+(5)))+(5)+4+1)+(((((((1)-(7))-((9)+(2)+1-(9+(4))))+(((4...

output:

-143

result:

ok 1 number(s): "-143"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3516kb

input:

((((((8+(6))+(3)-(1)+((4-(8))+4)+(((9)-((0-(3))+(1))-(4))-((2-(6))-(((9-(3))+(1)-((7)-((1)+((2)-(2)))))+(2+(6-(8)))))+(2+(0)))+(5+9+((2+4-(0))-(((5)+(1+3)-(((7-(1))-(2))-(1)))-(9+((2)-(3)))))+(((7)-((5)+1+9-(1)))-((4)-(5-(0+5)-((8)-((5)+(0))-((8)+(0)-(4)-(0)))))))-(((3)+(0)+3)-(8-(0)+4)))+((1-(2)+((...

output:

52

result:

ok 1 number(s): "52"