Submission #2526820
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<string> #include<cmath> #include<climits> #include<map> #include<set> #include<queue> #include<stack> #include<bitset> #include<iomanip> using namespace std; #define rep(i,j,n) for(int i=(j);i<(n);i++) #define rep2(i,j,n) for(int i=(j);i<=(n);i++) #define all(i) i.begin(),i.end() #define INF 1e9 typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef vector<string> vs; typedef vector<vector<string>> vvs; typedef pair<int, int> pi; typedef long long i64; int main() { int x, y; set<int> a{ 1,3,5,7,8,10,12 }; set<int> b{ 4,6,9,11 }; cin >> x >> y; if ((a.count(x) && a.count(y)) || (b.count(x) && b.count(y))) cout << "Yes\n"; else cout << "No\n"; }
Submission Info
Submission Time | |
---|---|
Task | A - Grouping |
User | playroller |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 768 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |