QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#367908#8509. Expanding STACKS!ucup-team1196#WA 0ms3604kbC++231.5kb2024-03-26 16:41:282024-03-26 16:41:29

Judging History

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

  • [2024-03-26 16:41:29]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3604kb
  • [2024-03-26 16:41:28]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
#define int long long

#define pii pair<int, int>
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    std::cin >> n;
    std::vector<int> a(2 * n + 1), q1(n + 1), q2(n + 1);
    map<int, int> mp, is;
    std::vector<int> ans(n + 1);
    priority_queue<pii> hp1, hp2;
    for (int i = 1; i <= 2 * n; i++) {
        std::cin >> a[i];
    }
    for (int i = 1; i <= 2 * n; i++) {
        if(a[i] > 0) {
            hp1.push({i, a[i]});
            is[a[i]] = 1;
        } else {
            a[i] *= -1;
            if(!is[a[i]]) {
                cout << "*\n";
                return 0;
            }
            if(is[a[i]] == 1) {
                while(hp1.size()) {
                    auto [id, x] = hp1.top();
                    hp1.pop();
                    if(x != a[i]) {
                        hp2.push({id, x});
                        is[x] = 2;
                    } else {
                        ans[a[i]] = 1;
                        break;
                    }
                }
            } else {
                if(hp2.top().second == a[i]) {
                    hp2.pop();
                    ans[a[i]] = 2;
                } else {
                    cout << "*\n";
                    return 0;
                }
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        std::cout << " GS"[ans[i]];
    }
    std::cout << "\n";
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3484kb

input:

2
+2 +1 -1 -2

output:

GG

result:

ok correct

Test #2:

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

input:

2
+1 +2 -1 -2

output:

GS

result:

ok correct

Test #3:

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

input:

3
+1 +2 +3 -1 -2 -3

output:

*

result:

ok correct

Test #4:

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

input:

10
+3 -3 +4 -4 +6 +2 -2 -6 +7 -7 +5 -5 +10 +1 +9 +8 -8 -9 -1 -10

output:

GGGGGGGGGG

result:

ok correct

Test #5:

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

input:

10
+8 -8 +2 +10 -2 -10 +7 -7 +1 -1 +6 -6 +5 +3 +4 +9 -9 -4 -3 -5

output:

GGGGGGGGGS

result:

ok correct

Test #6:

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

input:

42
+26 -26 +12 +8 -12 -8 +30 +5 +22 +3 -3 +2 -30 +10 -10 -2 -22 +23 +39 -39 +17 -17 -23 +38 +24 -24 +27 +29 -29 -27 -38 -5 +37 -37 +21 +16 +28 -28 +6 +40 +14 +19 -19 -14 +11 +35 -35 -11 +4 +25 -25 -4 -40 -6 +13 +20 +1 -1 +33 +34 +7 -7 -34 +41 -41 +36 +31 -31 -36 +42 +32 -32 +15 +18 -18 -15 +9 -9 -42...

output:

GSGGSGGSGGGGGGGGGGGGGSGGGGGGGGGGGGGGGGGGGG

result:

ok correct

Test #7:

score: -100
Wrong Answer
time: 0ms
memory: 3532kb

input:

42
+40 +18 +42 +2 +1 +21 +33 -2 +8 -33 -8 +14 -40 +34 +30 +31 -31 -30 +5 -5 +4 -34 +13 +3 -13 -3 -4 +28 -28 +17 -17 +35 +10 -10 +16 +39 +36 +37 -37 -36 -39 +25 +6 +41 -41 +20 +12 +32 -32 -25 -12 -16 -35 +38 -20 -38 -14 +15 -15 +9 +26 +23 -21 -1 +7 -23 +22 +24 -7 -24 -42 -18 -22 -26 -9 -6 +27 +29 -29...

output:

*

result:

wrong answer team and jury output doesn't agree on whether there's an assignment