QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#247766#7622. Yet Another Coffeeucup-team135#WA 0ms3612kbC++201.2kb2023-11-11 15:54:022023-11-11 15:54:03

Judging History

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

  • [2023-11-11 15:54:03]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3612kb
  • [2023-11-11 15:54:02]
  • 提交

answer

//
// Created by block-of-cats on 28.10.23.
//
#include <bits/stdc++.h>

using namespace std;
#define int long long
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;cin>>t;
    for(int cyc=0;cyc<t;++cyc)
    {
        int n,m;cin>>n>>m;int a[n];for(int i=0;i<n;++i) cin>>a[i];
       int w[n]={0};for(int i=0;i<m;++i) {int pos,x;cin>>pos>>x;--pos;w[pos]+=x;}
       vector<pair<int,int> > v;for(int i=0;i<n;++i) v.push_back({a[i],i});
       sort(v.begin(),v.end());int o[n];for(int i=0;i<v.size();++i) o[v[i].second]=i+1;
       int s=0;
       int suf[n+1];int pref[n+1];fill(suf,suf+n+1,-1e18);fill(pref,pref+n+1,-1e18);
       for(int i=n-1;i>=0;--i) {
           s+=w[i];
           suf[o[i]]=max(suf[o[i]],s);
           pref[o[i]]=max(pref[o[i]],s);
       }
       for(int i=0;i<n;++i) suf[i+1]=max(suf[i],suf[i+1]);
        for(int i=n;i>=1;--i) pref[i-1]=max(pref[i-1],pref[i]);
        int cur=0;
        for(int i=0;i<n;++i)
        {
            cur+=v[i].first;
            int o1=suf[i+1];int o2=pref[i+1];
            cout<<min(cur-o1,cur-o2);if(i!=(n-1)) cout<<' ';
        }
        if(cyc!=(t-1)) cout<<'\n';

    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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 1046...

result:

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