Submission #2053950

Source Code Expand

Copy
```#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));

int main(){
ll n, a[100010], b[100010];
cin >> n;
REP(i,0,n) cin >> a[i];
REP(i,0,n) cin >> b[i];

ll c = 0, d = 0;
REP(i,0,n){
if(a[i] > b[i]) continue;
c += (b[i] - a[i]) / 2 + (b[i] - a[i]) % 2;
a[i] = b[i] + (b[i] - a[i]) % 2;
}

REP(i,0,n){
if(b[i] > a[i]) continue;
d += (a[i] - b[i]);
b[i] = a[i];
}

REP(i,0,n) if(b[i] < a[i]) c -= a[i] - b[i], d += a[i] - b[i];
if(c - d >= 0) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
```

#### Submission Info

Submission Time 2018-02-03 23:44:12+0900 B - Two Arrays ecasdqina C++14 (GCC 5.4.1) 300 905 Byte AC 10 ms 384 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt, 0_002.txt
All 300 / 300 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt
Case Name Status Exec Time Memory
0_000.txt 1 ms 256 KB
0_001.txt 1 ms 256 KB
0_002.txt 1 ms 256 KB
1_003.txt 7 ms 384 KB
1_004.txt 7 ms 384 KB
1_005.txt 9 ms 384 KB
1_006.txt 9 ms 384 KB
1_007.txt 9 ms 384 KB
1_008.txt 9 ms 384 KB
1_009.txt 9 ms 384 KB
1_010.txt 9 ms 384 KB
1_011.txt 9 ms 384 KB
1_012.txt 9 ms 384 KB
1_013.txt 9 ms 384 KB
1_014.txt 10 ms 384 KB
1_015.txt 9 ms 384 KB
1_016.txt 9 ms 384 KB
1_017.txt 9 ms 384 KB
1_018.txt 9 ms 384 KB
1_019.txt 9 ms 384 KB
1_020.txt 9 ms 384 KB
1_021.txt 9 ms 384 KB
1_022.txt 9 ms 384 KB
1_023.txt 9 ms 384 KB
1_024.txt 9 ms 384 KB
1_025.txt 9 ms 384 KB
1_026.txt 9 ms 384 KB
1_027.txt 9 ms 384 KB