QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#628826#9422. Two-star ContestZhou_JKWA 26ms7812kbC++231.6kb2024-10-10 22:36:382024-10-10 22:36:39

Judging History

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

  • [2024-10-10 22:36:39]
  • 评测
  • 测评结果:WA
  • 用时:26ms
  • 内存:7812kb
  • [2024-10-10 22:36:38]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=400005;
const long long INF=1e18;
int n,m,q;
int s[N];
int pool[N];
int id[N];
long long sum[N];
void solve()
{
    cin>>n>>m>>q;
    int (&p)[n+1][m+1]=*reinterpret_cast<int(*)[n+1][m+1]>(&pool);
    for(int i=1;i<=n;i++)
    {
        cin>>s[i];
        for(int j=1;j<=m;j++)
            cin>>p[i][j];
    }
    for(int i=1;i<=n;i++)
        id[i]=i;
    sort(id+1,id+n+1,[=](const int &x,const int &y){return s[x]<s[y];});
    long long mx=0;
    for(int i=1,j=1;i<=n;i=j)
    {
        while(j<=n&&s[id[i]]==s[id[j]]) j++;
        for(int k=i;k<j;k++)
        {
            sum[id[k]]=0;
            for(int l=1;l<=m;l++)
                if(p[id[k]][l]!=-1) sum[id[k]]+=p[id[k]][l];
            long long ret=max(mx-sum[id[k]]+1,0ll); 
            for(int l=1;l<=m;l++)
                if(p[id[k]][l]==-1)
                {
                    long long d=min((long long)q,ret);
                    p[id[k]][l]=d;
                    ret-=d;
                    sum[id[k]]+=d;
                }
            if(sum[id[k]]<=mx)
            {
                cout<<"No\n";
                return;
            }
        }
        for(int k=i;k<j;k++)
            mx=max(mx,sum[id[k]]);
    }
    cout<<"Yes\n";
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            cout<<p[i][j]<<" ";
        cout<<"\n";
    }
    return;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    int T;
    cin>>T;
    while(T--)
        solve();
    return 0;
}

詳細信息

Test #1:

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

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 3 
0 5 0 5 
3 4 0 4 
No
Yes
1 2 3 
4 5 6 
No
Yes
2 0 0 
1 0 0 

result:

ok ok 5 cases (5 test cases)

Test #2:

score: -100
Wrong Answer
time: 26ms
memory: 7704kb

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
Yes
0 849 0 0 33907 7926 9461 70117 
96295 96295 56792 96295 75461 0 19527 0 
12828 30553 40825 67577 91517 77952 55631 63781 
29385 0 0 0 750 0 0 0 
Yes
0 0 66436933 0 45419040 55642613 
0 62712753 0 21765515 56544945 12385026 
Yes
975402536 975402536 975402536 975402536 975402536 248560376 0 0 ...

result:

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