Submission #3265569
Source Code Expand
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <math.h> #include <stack> #include <queue> using namespace std; #define ll long long #define ull unsigned long long #define rep(i,N) for (int i=0;i<N;i++) //変数 int T,N,M; vector<int> A, B; //解法 void solve() { vector<int> reserve; rep(i, 101) { //焼き上げたたこ焼きを追加 rep(j, A.size()) { if (A[j] == i) { reserve.emplace_back(A[j]); } } //お客さんが来たら売る rep(j, B.size()) { if (B[j] == i) { if (reserve.size() == 0) { cout << "no"; return; } else { reserve.erase(reserve.begin()); } } } //時間の過ぎたたこ焼きを削除 for (int j = 0; j < reserve.size();) { if (reserve[j] == i - T) { reserve.erase(reserve.begin() + j); } else { j++; } } } cout << "yes"; return; } int main() { //入力 cin >> T >> N; A.resize(N); rep(i, N) { cin >> A[i]; } cin >> M; B.resize(M); rep(i, M) { cin >> B[i]; } solve(); cout << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | huma17 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1158 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 |