QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#344673#7964. 转化knightzzz1#WA 80ms18932kbC++171.3kb2024-03-04 21:11:482024-03-04 21:11:49

Judging History

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

  • [2024-03-04 21:11:49]
  • 评测
  • 测评结果:WA
  • 用时:80ms
  • 内存:18932kb
  • [2024-03-04 21:11:48]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
const int N = 4e5 ;
using ll = long long;
int n,l,r;
ll a[ N ] , b[ N ] , c[ N ] , d[ N ] ,ans[ N ];
double p;

void slove(){
    cin >> n ;
    bool fg = false ;
    for( int i = 1 ; i <= n ; i++ ) cin >> a[ i ] ;
    for( int i = 1 ; i <= n ; i++ ) {
        cin >> b [ i ] ; 
        if( a[ i ] && b[ i ] ){
            fg = true ;
        }
    }
    for( int i = 1 ; i <= n ; i++ ) cin >> c[ i ] ;
    ll sum = 0 ,dum = 0 ;
    for( int i = 1 ; i <= n ; i ++ ){
        if( fg ){
            sum += ( a[ i ] + c[ i ] ) ;
            d[ i ] = min( b[ i ] , a[ i ] + c[ i ] ) ;
            dum += d[ i ] ;
        }
        else{
            if( a[ i ] > 0 ){
                sum += ( a[ i ] + c[ i ] ) ;
                d[ i ] = min( b[ i ] , a[ i ] + c[ i ] ) ;
                dum += d[ i ] ;
            }
        }
        
    }
    for( int i = 1 ; i <= n ; i++ ){
        ans[ i ] =  ( dum - d[ i ] ) ;
        if( fg || a[ i ] > 0 ){
            ans[ i ] += a[ i ] + c[ i ]  ;
        }
        cout << ans[ i ] << " ";
    }
    cout << endl << sum << endl;
}

int main(){
 
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);    

    int T  = 1 ; 
    // cin >> T ;
    while( T -- ){
        slove();
    }
    
    return 0;      
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 80ms
memory: 18932kb

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:

60073965108098 60073472434579 60073472434579 60073481786076 60073472434579 60073788795704 60073528186939 60073472434579 60073844417038 60073784237527 60073472434579 60073472434579 60073948724359 60073472434579 60073472434579 60073667243820 60073550392304 60073472434579 60073631606704 60073472434579 ...

result:

wrong answer 1st lines differ - expected: '60073965049724 60073472376204 ...4 60073701685447 60073472376204', found: '60073965108098 60073472434579 ... 60073701743821 60073472434579 '