QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#638183#9422. Two-star ContestzhaaaWA 34ms5992kbC++142.0kb2024-10-13 15:07:592024-10-13 15:08:00

Judging History

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

  • [2024-10-13 15:08:00]
  • 评测
  • 测评结果:WA
  • 用时:34ms
  • 内存:5992kb
  • [2024-10-13 15:07:59]
  • 提交

answer

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int>PII;
const int N=1e6+10;
const ll MX=1e9+10;
ll n,m,k;
struct MS{
    ll id,sum,cnt,s;
}a[N];
bool cmp(MS a,MS b){
    return a.s>b.s;
}

void solve(){
    cin>>n>>m>>k;
    vector<ll>v1[n+10];
    for(int i=1;i<=n;i++){
        ll s,sum=0,cnt=0;
        cin>>s;
        for(int j=1;j<=m;j++){
            ll s1;
            cin>>s1;
            v1[i].push_back(s1);
            if(s1>=0){
                sum+=s1;
            }else{
                cnt++;
            }
        }
        a[i]={i,sum,cnt,s};
    }
    sort(a+1,a+1+n,cmp);
    //a[n+1]={MX,MX,MX,MX};
    map<ll,ll>mp;
    ll l=0,r=k*m;
    bool f=false;
    for(int i=1;i<=n;i++){
        if(a[i].s!=a[i-1].s){
            mp[a[i-1].s]=r;
            r--;
            l=a[i].sum;
            r=min(r,a[i].sum+k*a[i].cnt);
            if(l>r&&i!=n+1){
                f=true;
                break;
            }
        }else{
            l=max(l,a[i].sum);
            r=min(r,a[i].sum+a[i].cnt*k);
            if(l>r){
                f=true;
                break;
            }
        }
    }
    mp[a[n].s]=r;
    if(f){
        cout<<"No"<<endl;
        return;
    }
    cout<<"Yes"<<endl;
    vector<ll>v[n+10];
    for(int i=1;i<=n;i++){
        ll id=a[i].id;
        ll sum=mp[a[i].s]-a[i].sum;
        for(int j=0;j<m;j++){
            if(v1[id][j]!=-1){
                v[id].push_back(v1[id][j]);
            }else{
                ll t=min(sum,k);
                v[id].push_back(t);
                sum-=t;
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=0;j<m;j++){
            cout<<v[i][j]<<" ";
        }
        cout<<endl;
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

詳細信息

Test #1:

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

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 9999 
10000 10000 9998 

result:

ok ok 5 cases (5 test cases)

Test #2:

score: -100
Wrong Answer
time: 34ms
memory: 5992kb

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:

No
No
Yes
72716304 58625957 66436933 0 45419040 55642613 
72716304 62712753 72716304 21765515 56544945 12385026 
Yes
975402536 975402536 975402536 975402536 975402536 372427170 0 0 0 
975402536 975402536 975402536 975402536 211610436 944794448 67558026 0 0 
788675016 424172233 162632689 465907153 20...

result:

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