Submission #147631
Source Code Expand
#include <algorithm> #include <cfloat> #include <climits> #include <cmath> #include <complex> #include <cstdio> #include <cstdlib> #include <cstring> #include <functional> #include <iostream> #include <map> #include <memory> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <utility> #include <vector> using namespace std; #define sz size() #define pb push_back #define mp make_pair #define fi first #define se second #define all(c) (c).begin(), (c).end() #define rep(i,a,b) for(int i=(a);i<(b);++i) #define clr(a, b) memset((a), (b) ,sizeof(a)) vector<string> split(string s, char c){ vector<string> ret; string s1; for(int i = 0; i <= s.size(); i++){ if(i == s.size()){ ret.push_back(s1); return ret; } if(s[i] == c){ ret.push_back(s1); s1 = ""; } else{ s1 += s[i]; } } } int ston(string s){ int n; sscanf(s.c_str(), "%d", &n); return n; } int main(){ int t; int n,m; cin >> t; cin >> n; vector<int> v1,v2; rep(i,0,n){ int a; cin >> a; v1.pb(a); } cin >> m; rep(i,0,m){ int a; cin >> a; v2.pb(a); } int d1[101]; int d2[101]; rep(i,0,n){ d1[i] = 1; } rep(i,0,m){ d2[i] = 1; } f: rep(i,0,m){ if(d2[i] == 0)continue; rep(j,0,n){ if(d1[j] == 0)continue; if(v2[i]-v1[j]>t || v2[i]-v1[i]<0){ d1[j] = 0; d2[i] = 0; } } } int flag = 0; rep(i,0,m){ if(d2[i] == 1){ flag = 1; } } if(flag == 1){ cout << "no" << endl; } else{ cout << "yes" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | cls0001011 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1817 Byte |
Status | WA |
Exec Time | 22 ms |
Memory | 932 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 | AC | 21 ms | 804 KB |
rand1.txt | AC | 21 ms | 680 KB |
rand10.txt | WA | 21 ms | 796 KB |
rand11.txt | AC | 20 ms | 800 KB |
rand12.txt | AC | 19 ms | 804 KB |
rand13.txt | AC | 20 ms | 804 KB |
rand14.txt | AC | 21 ms | 804 KB |
rand15.txt | AC | 21 ms | 680 KB |
rand16.txt | AC | 20 ms | 808 KB |
rand17.txt | WA | 21 ms | 932 KB |
rand18.txt | AC | 21 ms | 928 KB |
rand19.txt | AC | 20 ms | 804 KB |
rand2.txt | AC | 21 ms | 804 KB |
rand20.txt | AC | 21 ms | 804 KB |
rand21.txt | AC | 20 ms | 804 KB |
rand22.txt | AC | 21 ms | 928 KB |
rand23.txt | AC | 21 ms | 804 KB |
rand24.txt | AC | 21 ms | 932 KB |
rand25.txt | AC | 20 ms | 804 KB |
rand26.txt | AC | 20 ms | 804 KB |
rand27.txt | AC | 22 ms | 804 KB |
rand28.txt | WA | 21 ms | 804 KB |
rand29.txt | WA | 21 ms | 808 KB |
rand3.txt | AC | 20 ms | 808 KB |
rand4.txt | WA | 20 ms | 804 KB |
rand5.txt | AC | 20 ms | 804 KB |
rand6.txt | AC | 21 ms | 808 KB |
rand7.txt | WA | 19 ms | 800 KB |
rand8.txt | AC | 21 ms | 800 KB |
rand9.txt | AC | 21 ms | 680 KB |
s1.txt | WA | 21 ms | 804 KB |
s2.txt | AC | 21 ms | 808 KB |
s3.txt | AC | 20 ms | 800 KB |
s4.txt | AC | 20 ms | 804 KB |
s5.txt | AC | 21 ms | 932 KB |