QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#693544#9422. Two-star ContestcoolarecWA 21ms4720kbC++201.7kb2024-10-31 16:21:072024-10-31 16:21:19

Judging History

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

  • [2024-10-31 16:21:19]
  • 评测
  • 测评结果:WA
  • 用时:21ms
  • 内存:4720kb
  • [2024-10-31 16:21:07]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include"algo/debug.h"
#else
#define debug(x) 42
#endif
#define int long long
void solve(){
    int n,m,k;cin>>n>>m>>k;
    map<int,vector<int>> pos;
    vector<vector<int>> a(n+1,vector<int>(m+1));
    vector<int> rk;
    for(int i=1;i<=n;i++){
        int val;cin>>val;
        pos[val].push_back(i);
        rk.push_back(val);
        for(int j=1;j<=m;j++)cin>>a[i][j];
    }
    
    sort(rk.begin(),rk.end());
    rk.erase(unique(rk.begin(),rk.end()),rk.end());
    reverse(rk.begin(),rk.end());
    int up=1e18;

    auto getmaxx=[&](int x){
        int ans=0;
        for(int i=1;i<=m;i++){
            if(a[x][i]==-1)ans+=k;
            else ans+=a[x][i];
        }
        return ans;
    };
    auto getminn=[&](int x){
        int ans=0;
        for(int i=1;i<=m;i++){
            if(a[x][i]==-1)ans+=0;
            else ans+=a[x][i];
        }
        return ans;
    };
    for(int i=0;i<n;i++){

        int minn=1e18;

        for(auto x:pos[rk[i]]){
            a[x][0]=min(up-1,getmaxx(x));
            if(a[x][0]<getminn(x))return cout<<"No\n",void();
            minn=min(minn,a[x][0]);
        }

        up=minn;
    }
    cout<<"Yes\n";
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++)if(a[i][j]!=-1)a[i][0]-=a[i][j];
        for(int j=1;j<=m;j++){
            if(a[i][j]==-1)a[i][j]=min(k,a[i][0]),a[i][0]-=a[i][j];
            cout<<a[i][j]<<' ';
        }
        cout<<'\n';
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T=1;
    cin>>T;
    while (T--){
        solve();
    }
    return 0;
}

詳細信息

Test #1:

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

input:

5
3 4 5
5 1 3 -1 -1
2 -1 5 -1 5
3 3 -1 -1 4
2 3 10
10000 5 0 -1
1 10 10 10
2 3 10
10 1 2 3
100 4 5 6
2 3 10
100 1 2 3
10 4 5 6
2 3 10000
100 -1 -1 -1
1 -1 -1 -1

output:

Yes
1 3 5 5 
2 5 0 5 
3 5 1 4 
No
Yes
1 2 3 
4 5 6 
No
Yes
10000 10000 10000 
10000 10000 9999 

result:

ok ok 5 cases (5 test cases)

Test #2:

score: -100
Wrong Answer
time: 21ms
memory: 4720kb

input:

1013
3 2 1
1 -1 -1
2 0 1
3 -1 -1
4 8 96295
302790137 -1 849 -1 -1 33907 7926 9461 70117
695984050 -1 -1 56792 -1 -1 -1 19527 -1
302790137 12828 30553 40825 67577 91517 77952 55631 63781
302790137 29385 -1 -1 -1 750 -1 -1 -1
2 6 72716304
892657961 -1 -1 66436933 -1 45419040 55642613
892657961 -1 6271...

output:

Yes
0 0 
0 1 
1 1 
No
Yes
72716304 58625956 66436933 0 45419040 55642613 
72716304 62712753 72716303 21765515 56544945 12385026 
Yes
975402536 975402536 975402536 975402536 975402536 975402536 67482408 0 0 
975402536 975402536 975402536 975402536 211610436 944794448 67558026 0 0 
788675016 424172233...

result:

wrong answer Participant fails to find an answer while the jury found one. (test case 2)