Submission #3565830
Source Code Expand
#include<iostream> #include<algorithm> #include<string> #include<vector> #include<queue> #include<map> #include<cmath> using namespace std; #define REP(i, limit) for(int i=0; i< limit; ++i) #define FOR(i, j, limit) for(int i=j; i< limit; ++i) #define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;} #define LL long long int INF = 2147483647; LL LINF = 9223372036854775807; LL MOD = 1000000007; typedef pair<int, int>P; typedef pair<LL, LL>PL; typedef vector<int> vi; typedef vector<LL> vl; int main(){ int N; cin>>N; int a[N], b[N]; LL suma=0, sumb=0; LL judge=0; REP(i, N) { cin>>a[i]; suma+=a[i]; } REP(i, N) { cin>>b[i]; sumb+=b[i]; } if(suma>sumb) { cout<<"No"<<endl; return 0; } REP(i, N){ if(a[i]>b[i]){ judge -= (a[i]-b[i]); } else{ judge += (b[i]-a[i]); } //cout<<judge<<endl; } if(judge<0) cout<<"No"<<endl; else cout<<"Yes"<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Two Arrays |
User | howahowa |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1037 Byte |
Status | WA |
Exec Time | 12 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 | WA | 1 ms | 256 KB |
0_002.txt | AC | 1 ms | 256 KB |
1_003.txt | AC | 9 ms | 384 KB |
1_004.txt | AC | 9 ms | 384 KB |
1_005.txt | AC | 12 ms | 384 KB |
1_006.txt | AC | 12 ms | 256 KB |
1_007.txt | AC | 12 ms | 384 KB |
1_008.txt | AC | 12 ms | 256 KB |
1_009.txt | AC | 12 ms | 256 KB |
1_010.txt | AC | 12 ms | 384 KB |
1_011.txt | AC | 12 ms | 384 KB |
1_012.txt | WA | 12 ms | 384 KB |
1_013.txt | AC | 12 ms | 256 KB |
1_014.txt | AC | 12 ms | 256 KB |
1_015.txt | WA | 12 ms | 256 KB |
1_016.txt | WA | 12 ms | 256 KB |
1_017.txt | AC | 12 ms | 256 KB |
1_018.txt | AC | 12 ms | 256 KB |
1_019.txt | WA | 12 ms | 384 KB |
1_020.txt | AC | 12 ms | 384 KB |
1_021.txt | AC | 11 ms | 256 KB |
1_022.txt | AC | 11 ms | 384 KB |
1_023.txt | AC | 12 ms | 384 KB |
1_024.txt | AC | 12 ms | 256 KB |
1_025.txt | AC | 12 ms | 384 KB |
1_026.txt | AC | 12 ms | 256 KB |
1_027.txt | AC | 12 ms | 256 KB |