Submission #2054987
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
bool solve(int N, vi& a, vi& b) {
ll plus = 0, minus2 = 0, minus1 = 0;
rep(i, N) {
ll di = a[i] - b[i];
if (di > 0) {
plus += di;
} else if (di < 0) {
minus2 += -di / 2;
minus1 += -di % 2;
}
}
if (plus > minus2) return false;
return true;
}
int main() {
int N = loadint();
vector<int> a(N), b(N);
loadvec(a, N);
loadvec(b, N);
cout << (solve(N, a, b) ? "Yes":"No") << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Two Arrays |
User |
naoya_t |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
2307 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
384 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 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 |
2 ms |
384 KB |
1_004.txt |
AC |
2 ms |
384 KB |
1_005.txt |
AC |
2 ms |
384 KB |
1_006.txt |
AC |
2 ms |
384 KB |
1_007.txt |
AC |
2 ms |
384 KB |
1_008.txt |
AC |
2 ms |
384 KB |
1_009.txt |
AC |
2 ms |
384 KB |
1_010.txt |
AC |
2 ms |
384 KB |
1_011.txt |
AC |
2 ms |
384 KB |
1_012.txt |
AC |
2 ms |
384 KB |
1_013.txt |
AC |
2 ms |
384 KB |
1_014.txt |
AC |
2 ms |
384 KB |
1_015.txt |
AC |
2 ms |
384 KB |
1_016.txt |
AC |
2 ms |
384 KB |
1_017.txt |
AC |
2 ms |
384 KB |
1_018.txt |
AC |
2 ms |
384 KB |
1_019.txt |
AC |
2 ms |
384 KB |
1_020.txt |
AC |
2 ms |
384 KB |
1_021.txt |
AC |
2 ms |
384 KB |
1_022.txt |
AC |
2 ms |
384 KB |
1_023.txt |
AC |
2 ms |
384 KB |
1_024.txt |
AC |
2 ms |
384 KB |
1_025.txt |
AC |
2 ms |
384 KB |
1_026.txt |
AC |
2 ms |
384 KB |
1_027.txt |
AC |
2 ms |
384 KB |