Submission #7588915
Source Code Expand
#include <iostream> #include <vector> using namespace std; int main() { int T, N; cin >> T >> N; // int A[N]; vector<int> A(N); for (int i = 0; i < N; i++) { cin >> A[i]; } int M; cin >> M; int B[M]; // vector<int> B(N); for (int i = 0; i < M; i++) { cin >> B[i]; } if (N < M) { // お客の方が多い場合 cout << "no" << endl; return 0; } for (int i = 0; i < M; i++) { // int arriveTime = B[i]; // お客の到着した時間 bool soldFlag = false; while (A.size() > 0) { int timeInterval = B[i] - A[0]; if (0 <= timeInterval && timeInterval <= T) { // お客さんにたこ焼きを売れる場合 // cout << "売れた!" << endl; A.erase(A.begin()); soldFlag = true; break; } else if (timeInterval > T) { A.erase(A.begin()); } else { // cout << "A[j] = " << A[j] << ", B[i] = " << B[i] << endl; cout << "no" << endl; return 0; } } if (!soldFlag) { cout << "no" << endl; return 0; } // int timeInterval = B[i] - A[i]; // if (timeInterval < 0 || T < timeInterval) { // cout << "no" << endl; // return 0; // } } cout << "yes" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | mataneko |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1339 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 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 | AC | 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 | AC | 1 ms | 256 KB |
rand19.txt | AC | 1 ms | 256 KB |
rand2.txt | AC | 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 | AC | 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 | AC | 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 |