Submission #5630822
Source Code Expand
#include <ios> #include <iomanip> #include <iostream> #include <functional> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <string> #include <sstream> #include <complex> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <climits> using namespace std; typedef long long int ll; typedef long double ld; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define all(x) (x).begin(),(x).end() #define MOD 1000000007 #define INF (1e9) #define PI (acos(-1)) #define print(x) cout << x << endl ll gcd(ll a, ll b) { return b ? gcd(b,a%b) : a;} ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } typedef pair <ll,ll> P; ll nCrModp(ll n, ll r, ll p) { ll C[r+1]; memset(C, 0, sizeof(C)); C[0] = 1; for (ll i = 1; i <= n; i++) { for (ll j = min(i, r); j > 0; j--) C[j] = (C[j] + C[j-1])%p; } return C[r]; } int main() { ll N; cin >> N; vector<ll> A(N); rep(i, N) cin >> A[i]; vector<ll> B(N); rep(i, N) cin >> B[i]; ll sumA = 0; ll sumB = 0; rep(i, N) { sumA += A[i]; sumB += B[i]; } if (sumA > sumB) { cout << "No" << endl; return 0; } ll cnt = 0; rep(i, N) { if (A[i] > B[i]) { cnt += A[i]-B[i]; } else { cnt += (B[i]-A[i] + 2 - 1) / 2; } } if (cnt > sumB - sumA) { cout << "No" << endl; } else { cout << "Yes" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Two Arrays |
User | akimotty |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1645 Byte |
Status | WA |
Exec Time | 9 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 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 | AC | 1 ms | 256 KB |
0_001.txt | AC | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 7 ms | 384 KB |
1_004.txt | AC | 7 ms | 384 KB |
1_005.txt | AC | 9 ms | 384 KB |
1_006.txt | AC | 9 ms | 384 KB |
1_007.txt | AC | 9 ms | 384 KB |
1_008.txt | AC | 9 ms | 384 KB |
1_009.txt | AC | 9 ms | 384 KB |
1_010.txt | AC | 9 ms | 384 KB |
1_011.txt | AC | 9 ms | 384 KB |
1_012.txt | AC | 9 ms | 384 KB |
1_013.txt | AC | 9 ms | 384 KB |
1_014.txt | WA | 9 ms | 384 KB |
1_015.txt | AC | 9 ms | 384 KB |
1_016.txt | AC | 9 ms | 384 KB |
1_017.txt | AC | 9 ms | 384 KB |
1_018.txt | WA | 9 ms | 384 KB |
1_019.txt | AC | 9 ms | 384 KB |
1_020.txt | AC | 9 ms | 384 KB |
1_021.txt | AC | 9 ms | 384 KB |
1_022.txt | AC | 9 ms | 384 KB |
1_023.txt | AC | 9 ms | 384 KB |
1_024.txt | AC | 9 ms | 384 KB |
1_025.txt | AC | 9 ms | 384 KB |
1_026.txt | AC | 9 ms | 384 KB |
1_027.txt | AC | 9 ms | 384 KB |