Submission #3565911
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define IOS ios::sync_with_stdio(false), cin.tie(0) #define REP(i, n) for (int i = 0; i < n; i++) #define FOR(i, a, b) for (int i = a; i < b; i++) #define ALL(x) (x).begin(), (x).end() #define dump(x) cout << (x) << endl #define LMAX 9223372036854775807LL #define LMIN -9223372036854775807LL using ll = long long; template<typename T> using vec = vector<T>; using P = pair<ll, ll>; template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){ fill((T *)array, (T *)(array + N), val); } const ll INF = 1e18; const ll mod = 1e9 + 7; //int dx[4] = {1,0,-1,0}; //int dy[4] = {0,1,0,-1}; //ll pas[51][52]; signed main(){ IOS; ll n; cin >> n; vec<ll> a(n),b(n); ll sum1,sum2; sum1 = sum2 = 0; REP(i,n){ cin >> a[i]; sum1 += a[i]; } REP(i,n){ cin >> b[i]; sum2 += b[i]; } ll sum = sum2 - sum1; ll tmp = 0; REP(i,n){ if(a[i] < b[i])tmp += ceil((b[i] - a[i]) * 0.5); else tmp += a[i] - b[i]; } dump(sum >= tmp ? "Yes" : "No"); }
Submission Info
Submission Time | |
---|---|
Task | B - Two Arrays |
User | jgvt5ti |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1117 Byte |
Status | WA |
Exec Time | 3 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 | 3 ms | 384 KB |
1_004.txt | AC | 3 ms | 384 KB |
1_005.txt | AC | 3 ms | 384 KB |
1_006.txt | AC | 3 ms | 384 KB |
1_007.txt | AC | 3 ms | 384 KB |
1_008.txt | AC | 3 ms | 384 KB |
1_009.txt | AC | 3 ms | 384 KB |
1_010.txt | AC | 3 ms | 384 KB |
1_011.txt | AC | 3 ms | 384 KB |
1_012.txt | AC | 3 ms | 384 KB |
1_013.txt | AC | 3 ms | 384 KB |
1_014.txt | WA | 3 ms | 384 KB |
1_015.txt | AC | 3 ms | 384 KB |
1_016.txt | AC | 3 ms | 384 KB |
1_017.txt | AC | 3 ms | 384 KB |
1_018.txt | WA | 3 ms | 384 KB |
1_019.txt | AC | 3 ms | 384 KB |
1_020.txt | AC | 3 ms | 384 KB |
1_021.txt | AC | 3 ms | 384 KB |
1_022.txt | AC | 3 ms | 384 KB |
1_023.txt | AC | 3 ms | 384 KB |
1_024.txt | AC | 3 ms | 384 KB |
1_025.txt | AC | 3 ms | 384 KB |
1_026.txt | AC | 3 ms | 384 KB |
1_027.txt | AC | 3 ms | 384 KB |