QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#663288#9477. Topological Sortucup-team093#WA 0ms3696kbC++20590b2024-10-21 14:39:252024-10-21 14:39:26

Judging History

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

  • [2024-10-21 14:39:26]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3696kb
  • [2024-10-21 14:39:25]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const int N = 2e5 + 10, P = 998244353;

int n, p[N], tr[N];

i64 ans;

int qpow(int b, i64 k) {
    int ret = 1;
    while(k > 0) {
        if(k & 1) ret = (i64)ret * b % P;
        b = (i64)b * b % P;
        k >>= 1;
    }
    return ret;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    ans = n * (n - 1ll) / 2;
    for(int i = 1; i <= n; i ++) {
        cin >> p[i];
        if(p[i] < p[i - 1]) ans --;
    }
    
    cout << qpow(2, ans) << "\n";
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
1 3 2

output:

4

result:

ok "4"

Test #2:

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

input:

5
1 2 3 4 5

output:

1024

result:

ok "1024"

Test #3:

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

input:

6
4 2 1 5 6 3

output:

4096

result:

ok "4096"

Test #4:

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

input:

492
397 486 227 395 58 452 172 216 130 181 268 482 85 209 365 104 373 90 260 326 252 96 267 106 102 398 441 41 292 314 12 78 242 353 153 424 179 86 299 228 54 390 73 465 396 349 4 10 451 99 342 250 391 6 323 197 159 47 136 473 392 77 125 362 418 255 291 13 238 339 8 28 413 121 384 157 152 23 221 305...

output:

692497022

result:

wrong answer 1st words differ - expected: '73428942', found: '692497022'