QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#764473#7964. 转化yasdf123#WA 257ms21360kbC++14865b2024-11-20 09:18:432024-11-20 09:18:43

Judging History

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

  • [2024-11-20 09:18:43]
  • 评测
  • 测评结果:WA
  • 用时:257ms
  • 内存:21360kb
  • [2024-11-20 09:18:43]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long

int a[4000006], b[4000006], c[4000006], an1[4000006];

signed main(){
	int n;
	cin >> n;
	int cnt = 0;
	for (int i = 0; i < n; i++){
		cin >> a[i];
		if (a[i] == 0){
			cnt++;
		}
	}
	for (int i = 0; i < n; i++){
		cin >> b[i];
	}
	for (int i = 0; i < n; i++){
		cin >> c[i];
		if (a[i] != 0){
			a[i] += c[i];
			c[i] = 0;
		}
	}
	int sum = 0;
	for (int i = 0; i < n; i++){
		if (a[i] != 0){
			sum += min(a[i], b[i]);
			an1[i] = a[i] - min(a[i], b[i]);
		}
	}
	for (int i = 0; i < n; i++){
		if (a[i] == 0 && b[i]>1 && c[i]>0&&sum>0){
			sum += min(b[i] - 1, c[i]);
			an1[i] = c[i] + 1 - min(b[i], c[i] + 1);
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++){
		ans += an1[i];
		cout << an1[i] + sum << " ";
	}
	cout << "\n";
	cout << ans + sum;
}

详细

Test #1:

score: 100
Accepted
time: 257ms
memory: 21360kb

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: 159ms
memory: 20812kb

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:

150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613 150613...

result:

wrong answer 1st lines differ - expected: '389246793 773056414 285033292 ...47596 273937941 15883376 150613', found: '150613 150613 150613 150613 15...13 150613 150613 150613 150613 '