QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#715647#7964. 转化szy10010#WA 71ms18164kbC++201.4kb2024-11-06 12:51:562024-11-06 12:51:57

Judging History

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

  • [2024-11-06 12:51:57]
  • 评测
  • 测评结果:WA
  • 用时:71ms
  • 内存:18164kb
  • [2024-11-06 12:51:56]
  • 提交

answer

#include<iostream>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<unordered_map>

#define pb push_back
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(),(x).end()
#define _for(i, a) for(int i = 0; i < (a); ++i) 
#define _rep(i, a, b) for(int i = (a);i <= (b); ++i)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define u1 (u<<1)
#define u2 (u<<1|1)
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;

const int INF=0x3f3f3f3f;
const int P=1e9+7;
const int N=1e6+20,M=2*N;
int n,m,k,q[N];
int a[N],b[N],c[N];
void solve(){
	cin>>n;
	_rep(i,1,n)cin>>a[i];
	_rep(i,1,n)cin>>b[i];
	_rep(i,1,n)cin>>c[i];
	int cnt=0,sum=0,ans=0;
	int t=0;
	bool bl=false;
	_rep(i,1,n)
	{
		if(!a[i])
		{
			if(min(c[i]+1,b[i])>=1)
			{
				cnt++,sum+=min(c[i]+1,b[i]); 
			}
			t+=c[i];
		}
		else 
		{
			a[i]+=c[i];
			ans+=a[i];
			sum+=min(a[i],b[i]); 
			if(b[i])bl=true;
		}
	}
//	cout<<sum<<endl;
//	cout<<cnt<<endl;
	_rep(i,1,n)
	{
		if(!bl)cout<<a[i]<<" ";
		else 
		{
			if(!a[i])cout<<a[i]+sum-cnt-(min(c[i]+1,b[i])-1)+c[i]<<' ';
			else cout<<a[i]+sum-cnt-min(a[i],b[i])<<" ";
		}
	}
	cout<<'\n';
	if(!bl)cout<<ans;
	else cout<<ans+t;
}
signed main(){
	IOS;
	int T=1;
//	cin>>T;
	_rep(i,1,T){
		solve();
	}
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 71ms
memory: 15028kb

input:

351493
0 37836791 46095966 46912389 21595941 0 3 86568894 3 0 0 0 0 39910208 0 2 4 86885825 1 67660833 0 24488082 52447896 0 67190942 70457491 11166998 90470470 11095822 0 0 5 47222930 2 49736354 0 0 0 77339472 0 5 3 0 25347727 0 3 2 0 48844622 0 65142757 1 73733079 80634668 46683173 0 31644647 9760...

output:

60073965049724 60073472376204 60073472376204 60073481727701 60073472376204 60073788737330 60073528128564 60073472376204 60073844358663 60073784179153 60073472376204 60073472376204 60073948665985 60073472376204 60073472376204 60073667185445 60073550333929 60073472376204 60073631548329 60073472376204 ...

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 54ms
memory: 18164kb

input:

351493
0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...

output:

389246794 773056415 285033293 35143063 150613 960166466 230310735 742299191 422307528 716629611 559282117 167517604 440667607 980062125 288964465 150613 37777274 995600802 890644899 919111991 697350090 651910450 818599876 248723393 345836781 145972755 169220150 798545768 375398591 724669764 34806632...

result:

wrong answer 1st lines differ - expected: '389246793 773056414 285033292 ...47596 273937941 15883376 150613', found: '389246794 773056415 285033293 ...7597 273937942 15883377 150613 '