Submission #1780327
Source Code Expand
#include <cstdio> #include <cmath> #include <iostream> #include <ctime> #include <vector> #include <cstdlib> using namespace std; class tacoyaki{ public: int time; int sold; tacoyaki():time(0),sold(0){} }; int main(){ int t,n=0,m=0; int tac_n,cus_n; cin >> t; cin >> tac_n; vector<tacoyaki> taco(tac_n); for(int i =0;i<tac_n;i++){ cin >> taco[i].time; } cin >> cus_n; vector<int> cus(cus_n); for(int i = 0;i<cus_n;i++){ cin >> cus[i]; } for(int i = 0;i<cus_n;i++){ n = 0; for(int j=0;j<tac_n;j++){ if(((cus[i]-taco[j].time)<=t )&& ((cus[i]-taco[j].time)>=0 )&& (taco[j].sold == 0)){ taco[j].sold = 1; break; }else { n++; } } //cout <<"No." << i << "_n :" << n << "\n"; if(n == tac_n){ cout << "no\n"; break; } m++; } if(m == cus_n){ cout << "yes\n"; } // cout << t << "\n" << tac_n << "\n"; // // for(int i = 0;i<tac_n;i++){ // cout << taco[i].time<< " "; // } // cout << "\n" << cus_n << "\n"; // // for(int i = 0;i<cus_n;i++){ // cout << cus[i]<< " "; // } // cout << "\n"; // for(int i = 0;i<tac_n;i++){ // cout << taco[i].sold << " "; // } // cout << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | ataka |
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 |