Submission #1837705
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <string> #include <vector> #include <cmath> #include <fstream> #include <set> #include <utility> #include <algorithm> #include <queue> #include <stack> #include <deque> #include <numeric> #include <sstream> #include <list> #include <map> #include <functional> #include <iterator> #define rep(i,p,n) for(int i=(int)p;i<(int)n;i++) #define repp(i,p,n) for(int i=(int)p;i>=(int)n;i--) #define Sort(x) sort(x.begin(),x.end()); #define PSort(x) sort(begin(x), end(x), pairCompare) #define ll long long #define INF 2000000000 using namespace std; int main() { int n, m; cin >> n; vector<int> v(n); rep(i, 0, n)cin >> v[i]; cin >> m; vector<int> vv(m); rep(i, 0, m)cin >> vv[i]; Sort(v); Sort(vv); int pos = 0; rep(i, 0, m) { bool judge = true; rep(j, pos, n) { if (v[j] == vv[i]) { pos = j+1; judge = false; break; } } if (judge) { cout << "NO" << endl; return 0; } } cout << "YES" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Problem Set |
User | gotutiyan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1071 Byte |
Status | AC |
Exec Time | 183 ms |
Memory | 1792 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
dataset1 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt |
dataset2 | sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
01-08.txt | AC | 1 ms | 256 KB |
01-09.txt | AC | 1 ms | 256 KB |
02-01.txt | AC | 92 ms | 1024 KB |
02-02.txt | AC | 97 ms | 1024 KB |
02-03.txt | AC | 183 ms | 1792 KB |
02-04.txt | AC | 97 ms | 1024 KB |
02-05.txt | AC | 183 ms | 1792 KB |
02-06.txt | AC | 86 ms | 1024 KB |
02-07.txt | AC | 165 ms | 1792 KB |
02-08.txt | AC | 167 ms | 1792 KB |
02-09.txt | AC | 167 ms | 1792 KB |
02-10.txt | AC | 167 ms | 1792 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |
sample-03.txt | AC | 1 ms | 256 KB |
sample-04.txt | AC | 1 ms | 256 KB |