Submission #383502
Source Code Expand
#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
using namespace std;
#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define fe(i,b) for (auto &(x):b);
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()
#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num
#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]
typedef complex<double> P;
typedef vector<P> Poly;
const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };
int main(void){
bool used[101] = {false};
int N, a, b, K, P;
cin >> N >> a >> b;
used[a] = used[b] = true;
cin >> K;
bool f = true;
rT(i, K){
cin >> P;
if (used[P])f = false;
else used[P] = true;
}
if (f)cout << "YES" << endl;
else cout << "NO" << endl;
return(0);
}
Submission Info
Submission Time |
|
Task |
B - 嘘つきの高橋くん |
User |
btk15049 |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1614 Byte |
Status |
AC |
Exec Time |
27 ms |
Memory |
928 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask0_sample_05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
25 ms |
920 KB |
subtask0_sample_02.txt |
AC |
24 ms |
804 KB |
subtask0_sample_03.txt |
AC |
23 ms |
800 KB |
subtask0_sample_04.txt |
AC |
24 ms |
800 KB |
subtask0_sample_05.txt |
AC |
24 ms |
808 KB |
subtask1_01.txt |
AC |
24 ms |
676 KB |
subtask1_02.txt |
AC |
25 ms |
840 KB |
subtask1_03.txt |
AC |
26 ms |
808 KB |
subtask1_04.txt |
AC |
26 ms |
804 KB |
subtask1_05.txt |
AC |
25 ms |
800 KB |
subtask1_06.txt |
AC |
25 ms |
928 KB |
subtask1_07.txt |
AC |
24 ms |
804 KB |
subtask1_08.txt |
AC |
24 ms |
800 KB |
subtask1_09.txt |
AC |
24 ms |
800 KB |
subtask1_10.txt |
AC |
22 ms |
672 KB |
subtask1_11.txt |
AC |
24 ms |
924 KB |
subtask1_12.txt |
AC |
25 ms |
920 KB |
subtask1_13.txt |
AC |
24 ms |
804 KB |
subtask1_14.txt |
AC |
24 ms |
928 KB |
subtask1_15.txt |
AC |
24 ms |
800 KB |
subtask1_16.txt |
AC |
25 ms |
924 KB |
subtask1_17.txt |
AC |
25 ms |
924 KB |
subtask1_18.txt |
AC |
25 ms |
844 KB |
subtask1_19.txt |
AC |
23 ms |
676 KB |
subtask1_20.txt |
AC |
24 ms |
924 KB |
subtask1_21.txt |
AC |
27 ms |
924 KB |
subtask1_22.txt |
AC |
25 ms |
796 KB |
subtask1_23.txt |
AC |
25 ms |
928 KB |
subtask1_24.txt |
AC |
25 ms |
736 KB |