QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#638495#9422. Two-star ContestPasser_byWA 14ms6696kbC++172.4kb2024-10-13 16:03:492024-10-13 16:03:51

Judging History

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

  • [2024-10-13 16:03:51]
  • 评测
  • 测评结果:WA
  • 用时:14ms
  • 内存:6696kb
  • [2024-10-13 16:03:49]
  • 提交

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;
}
int ss=0,sst=0,f[N];
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};
    }
    if(ss>100){
        if(sst==17){
            cout<<n<<" "<<m<<" "<<k<<endl;
            for(int i=1;i<=n;i++){
                cout<<f[i]<<" ";
                for(int j=0;j<m;j++){
                    cout<<v1[i][j]<<" ";
                }
                cout<<endl;
            }
        }
        return ;
    }
    sort(a+1,a+1+n,cmp);
    //a[n+1]={MX,MX,MX,MX};
    map<ll,ll>mp;
    ll l=0,r=1e18+10;
    bool f=false;
    for(int i=1;i<=n;i++){
        if(a[i].s!=a[i-1].s&&i!=1){
            if(l>r) 
            {
                f=true;
                break;
            }
            mp[a[i-1].s]=r;
            r--;
            
            l=a[i].sum;
            r=min(r,a[i].sum+k*a[i].cnt);
            //cout<<l<<" "<<r<<endl;
            if(l>r&&i!=n+1){
                //cout<<i<<endl;
                f=true;
                break;
            }
        }else{
            l=max(l,a[i].sum);
            r=min(r,a[i].sum+a[i].cnt*k);
        }
    }
    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=max(0ll,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;
    ss=t;
    while(t--){
        sst++;
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5604kb

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: 14ms
memory: 6696kb

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:

5 9 663126939
0 -1 261836984 365426518 -1 -1 554391691 473619896 -1 -1 
0 449690204 219096123 574594237 429959791 194308602 106249181 354568039 493657377 258744798 
0 588106615 341347076 199350324 518924484 -1 650294987 -1 490871185 312034770 
0 -1 -1 -1 -1 -1 -1 384886185 -1 -1 
0 -1 52903321 -1 -1...

result:

wrong answer Token parameter [name=yesno] equals to "5", doesn't correspond to pattern "Yes|No" (test case 1)