QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#638309 | #9422. Two-star Contest | Passer_by | WA | 0ms | 7952kb | C++17 | 3.5kb | 2024-10-13 15:37:05 | 2024-10-13 15:37:07 |
Judging History
answer
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pos string::npos
#define endl '\n'
#define inf 1e18
typedef unsigned long long ull;
const int mod = 998244353;
const int N = 6e5+20;
const int Maxn = 2e5+5;
int min(int a,int b){return a<b?a:b;}
int max(int a,int b){return a>b?a:b;}
int Inv[N],F[N];//组合数C2
int gcd(int a,int b){ return b == 0 ? a : gcd(b,a%b);}
int lcm(int a,int b){return (a/gcd(a,b)*b);}
int km(int a,int b,int mod)
{int ans=1;while(b){if(b&1) ans=ans*a%mod;b>>=1;a=a*a%mod;}return ans;}
int km1(int a,int b,int mod)//指数取模,2^2^i,单求2^i要取模MOD-1
{int ans=1;mod--;while(b){if(b&1) ans=ans*a%mod;b>>=1;a=a*a%mod;}return ans;}
int C(int a,int b,int p){if(b>a) return 0;int res=1;for(int i=b,j=a;i>=1;i--,j--){res=res*j%p;res=res*km(i,p-2,p)%p;}return res;}
int Lucas(int a,int b,int p){if(a<p&&b<p) return C(a,b,p);return C(a%p,b%p,p)*Lucas(a/p,b/p,p)%p;}
int C2(int a,int b,int p){return F[a]*Inv[a-b]%p*Inv[b]%p;}
void C2init(int n,int p){n--;F[0]=F[1]=1;for(int i=2;i<=n;i++)F[i]=F[i-1]*i%p;Inv[n]=km(F[n],p-2,p);for(int i=n-1;i>=0;i--)Inv[i]=Inv[i+1]*(i+1)%p;}
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
int n,k,m,c[N];
struct node{
int s,l,r,id;
}b[N];
bool cmp(node x,node y){
return x.s>y.s;
}
int tt=0,Tf=0;
void solve()
{
cin>>n>>m>>k;
for(int i=0;i<=n+1;i++){
b[i].s=0,b[i].l=0,b[i].r=0,b[i].id=0;
}
vector<vector<int> > a(n+10,vector<int>(m+10,0));
for(int i=1;i<=n;i++){
cin>>c[i];
int cnt=0,l=0,x;
b[i].s=c[i];
for(int j=1;j<=m;j++){
cin>>a[i][j];
x=a[i][j];
if(x==-1) cnt++;
else l+=x;
}
b[i].l=l,b[i].r=l+cnt*k,b[i].id=i;
}
// if(Tf>100) {
// if(tt==5){
// cout<<n<<" "<<m<<" "<<k<<endl;
// for(int i=1;i<=n;i++){
// cout<<c[i]<<" ";
// for(int j=1;j<=m;j++) cout<<a[i][j]<<" ";
// cout<<endl;
// }
// }
// return ;
// }
bool ok=1;
int num=-1,len=-1,cnt=-1;
sort(b+1,b+n+1,cmp);
for(int i=1;i<=n;i++){
int xx=i,l=b[i].l,r=b[i].r,cc=0;
if(b[i].s==b[i-1].s){
if(b[i].r<num) num=b[i].r;
}
else{
if(num==-1) num=r;
else{
num--;
if(l>num) ok=0;
else{
if(r<num) num=r;
}
}}
if(num<0) ok=0;
int sum=num-b[i].l;
//cout<<num<<" ";
if(num>b[i].r||num<b[i].l) ok=0;
for(int g=1;g<=m;g++){
if(a[b[i].id][g]!=-1) continue;
else {
if(sum>=k) sum-=k,a[b[i].id][g]=k;
else if(sum!=0&&sum<k) a[b[i].id][g]=sum,sum=0;
else a[b[i].id][g]=0;
}
}
//}
}
if(ok==0) {
cout<<"No"<<endl;
return ;
}
cout<<"Yes"<<endl;
for(int i=1;i<=n;i++){
int uu=0;
for(int j=1;j<=m;j++){
//cout<<a[i][j]<<" ";
uu+=a[i][j];
}
cout<<uu<<endl;
cout<<endl;
}
}
signed main()
{
ios;
int T=1;
//C2init(N,mod);
cin>>T;
Tf=T;
while(T--)
{
tt++;
solve();
}
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 7952kb
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 14 12 13 No Yes 6 15 No Yes 30000 29999
result:
wrong answer Integer parameter [name=q_{i, j}] equals to 14, violates the range [0, 5] (test case 1)