Submission #2239303
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define debugB(x, y) cerr<<#x<<": "<<bitset<y>(x) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
template<typename T>
void printA(vector<T> &printArray, char between = ' ') {
int paSize = printArray.size();
for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}
if (between != '\n') {cerr << endl;}
}
// ------------------------------------------------------------------------------------------
int T, N, M;
int A[111], B[111];
int main() {
cin >> T >> N;
rep (i, N) { cin >> A[i]; }
cin >> M;
rep (i,M) {
// cin >> B[i];
int b;
cin >> b;
bool ok = false;
rep (j, N) {
if (A[j] <= b && A[j]+T >= b) {
ok = true;
A[j] = -1;
break;
}
}
if (!ok) {
puts("no");
return 0;
}
}
puts("yes");
return 0;
}
Submission Info
Submission Time |
|
Task |
C - おいしいたこ焼きの売り方 |
User |
nomi |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1667 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
0 / 100 |
Status |
|
Set Name |
Test Cases |
All |
rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
Case Name |
Status |
Exec Time |
Memory |
rand0.txt |
WA |
1 ms |
256 KB |
rand1.txt |
AC |
1 ms |
256 KB |
rand10.txt |
AC |
1 ms |
256 KB |
rand11.txt |
AC |
1 ms |
256 KB |
rand12.txt |
AC |
1 ms |
256 KB |
rand13.txt |
WA |
1 ms |
256 KB |
rand14.txt |
AC |
1 ms |
256 KB |
rand15.txt |
AC |
1 ms |
256 KB |
rand16.txt |
AC |
1 ms |
256 KB |
rand17.txt |
AC |
1 ms |
256 KB |
rand18.txt |
WA |
1 ms |
256 KB |
rand19.txt |
AC |
1 ms |
256 KB |
rand2.txt |
WA |
1 ms |
256 KB |
rand20.txt |
AC |
1 ms |
256 KB |
rand21.txt |
AC |
1 ms |
256 KB |
rand22.txt |
AC |
1 ms |
256 KB |
rand23.txt |
AC |
1 ms |
256 KB |
rand24.txt |
AC |
1 ms |
256 KB |
rand25.txt |
WA |
1 ms |
256 KB |
rand26.txt |
AC |
1 ms |
256 KB |
rand27.txt |
AC |
1 ms |
256 KB |
rand28.txt |
AC |
1 ms |
256 KB |
rand29.txt |
AC |
1 ms |
256 KB |
rand3.txt |
AC |
1 ms |
256 KB |
rand4.txt |
AC |
1 ms |
256 KB |
rand5.txt |
AC |
1 ms |
256 KB |
rand6.txt |
AC |
1 ms |
256 KB |
rand7.txt |
AC |
1 ms |
256 KB |
rand8.txt |
AC |
1 ms |
256 KB |
rand9.txt |
WA |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |
s3.txt |
AC |
1 ms |
256 KB |
s4.txt |
AC |
1 ms |
256 KB |
s5.txt |
AC |
1 ms |
256 KB |