Submission #1608645
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <iostream> #include <iomanip> #include <algorithm> #include <string> #include <sstream> #include <vector> #include <deque> #include <complex> #include <functional> #include <utility> #include <iterator> #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i) #define ALL(x) (x).begin(), (x).end() #define INF 2000000000 //#define int long long int #ifdef LOCAL #define eprintf(...) fprintf(stdout, __VA_ARGS__) #else #define eprintf(...) 0 #endif using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef unsigned int uint; int main() { int t, n; cin >> t >> n; deque<int> takos(n); REP(i, n) { cin >> takos[i]; } int m; cin >> m; deque<int> visits(m); REP(i, m) { cin >> visits[i]; } while(visits.size()) { int visit = visits.front(); visits.pop_front(); while(1) { if(takos.empty()) { cout << "no" << endl; return 0; } int tako = takos.front(); eprintf("visit:%d tako:%d\n", visit, tako); takos.pop_front(); if(visit - tako > t) { continue; } else if(visit - tako < 0) { cout << "no" << endl; return 0; } else { break; } } } cout << "yes" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | yoshi_k |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1471 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 |