Submission #1091506
Source Code Expand
#include <iostream> #include <iomanip> #include <string> #include <vector> #include <queue> #include <algorithm> #include <utility> #include <cmath> #include <map> #include <set> #include <stack> #include <cstdio> #include <cstdlib> #include <cstring> #define INF_LL 1e18 #define INF 1e9 #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() using namespace std; using ll = long long; using PII = pair<int, int>; class Union_find{ private: vector<int> par; vector<int> rank; int n; public: Union_find(int a){ n = a; for(int i = 0;i < n;i++){ par.push_back(i); rank.push_back(0); } } int find(int x){ if(par[x] == x){ return x; }else{ return par[x] = find(par[x]); } } void unite(int x, int y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] < rank[y]){ par[x] = y; }else{ par[y] = x; if(rank[x] == rank[y]) rank[x]++; } } bool same(int x, int y){ return find(x) == find(y); } }; int main(void){ int N; ll a[100100]; int odd_n = 0; cin >> N; REP(i, N){ cin >> a[i]; if(a[i] % 2 == 1) odd_n++; } if(odd_n%2==0){ cout << "YES" << endl; }else{ cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - Addition |
User | maze1230 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1322 Byte |
Status | AC |
Exec Time | 120 ms |
Memory | 1532 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 120 ms | 1532 KB |
in10.txt | AC | 61 ms | 1024 KB |
in11.txt | AC | 3 ms | 256 KB |
in12.txt | AC | 2 ms | 256 KB |
in2.txt | AC | 54 ms | 1024 KB |
in3.txt | AC | 63 ms | 1024 KB |
in4.txt | AC | 67 ms | 1024 KB |
in5.txt | AC | 67 ms | 1024 KB |
in6.txt | AC | 67 ms | 1024 KB |
in7.txt | AC | 67 ms | 1024 KB |
in8.txt | AC | 65 ms | 1024 KB |
in9.txt | AC | 67 ms | 1024 KB |
sample1.txt | AC | 3 ms | 256 KB |
sample2.txt | AC | 3 ms | 256 KB |