QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#247160#7622. Yet Another Coffeeucup-team1196#WA 0ms3396kbC++141.2kb2023-11-11 13:32:062023-11-11 13:32:06

Judging History

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

  • [2023-11-11 13:32:06]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3396kb
  • [2023-11-11 13:32:06]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
#define int long long
constexpr int mod = 998244353;
struct Fenwick {
    int n;
    vector<int> tr;
    Fenwick(int x) : tr(x + 100), n(x) {}
    int lowbit(int x) {
        return x & (-x);
    }
    int query(int x) {
        int ans = 0;
        for(int i = x; i; i -= lowbit(i)) {
            ans += tr[i];
            ans %= mod;
        }
        return ans % mod;
    }
    void build(int x, int y) {
        for(int i = x; i <= n + 10; i += lowbit(i)) {
            tr[i] += y;
            tr[i] %= mod;
            tr[i] += mod;
            tr[i] %= mod;
        }
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int ans = 0;
    sort(a.begin() + 1, a.end());
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        ans -= y;
    }
    for(int i = 1; i <= n; i++) {
        ans += a[i];
        cout << ans << ' ';
    } cout << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t;
    cin >> t;
    while(t--) {
        solve();
    }
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3396kb

input:

5
10 14
17 37 59 65 53 73 68 177 160 111
10 177
5 193
2 30
3 63
2 339
3 263
5 178
2 190
9 23
10 328
10 200
9 8
3 391
6 230
12 9
152 306 86 88 324 59 18 14 42 260 304 55
3 50
2 170
1 252
7 811
1 713
7 215
10 201
4 926
8 319
19 20
182 74 180 201 326 243 195 31 170 263 284 233 48 166 272 281 179 116 31...

output:

-2596 -2559 -2506 -2447 -2382 -2314 -2241 -2130 -1970 -1793 
-3643 -3625 -3583 -3528 -3469 -3383 -3295 -3143 -2883 -2579 -2273 -1949 
-6678 -6630 -6556 -6440 -6274 -6104 -5925 -5745 -5563 -5368 -5167 -4934 -4691 -4428 -4156 -3875 -3591 -3272 -2946 
-3418 -3003 -2572 -2140 -1707 -1238 -768 -274 243 1...

result:

wrong answer 11th numbers differ - expected: '-3505', found: '-3643'