Submission #1604471
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> using namespace std; void c() { int t, n; cin >> t >> n; vector<int> a(n); for(int i = 0; i < n; i++) { cin >> a[i]; } int m; cin >> m; vector<int> b(m); for(int i = 0; i < m; i++) { cin >> b[i]; } if(n < m){ cout << "no" << endl; return; } int ti = 0; for(auto bi : b) { bool ok = false; for(; ti < n; ti++) { if((a[ti] + t >= bi) && (a[ti] <= bi)) { ok = true; ti++; break; } } if(!ok){ cout << "no" << endl; return; } } cout << "yes" << endl; } int CalcTotal(vector<vector<int>> &source, int x, int y, int rangex, int rangey) { int total = 0; for(int i = 0; i < rangex; i++) { for(int j = 0; j< rangey; j++) { total += source[x + i][y + j]; } } return total; } void d() { int n; cin >> n; vector<vector<int>> d(n); for(int i = 0; i < n; i++) { for(int j = 0; j < n; j++) { int temp; cin >> temp; d[i].push_back(temp); } } int q; cin >> q; vector<int> p(q); for(int i = 0; i < q; i++) { cin >> p[i]; } int result[2501] = {0}; for(int i = 1; i <= n * n; i++) { vector<pair<int, int>> can; for(int j = 1; j <= n; j++) { for(int k = 1; k <= n; k++) { if(i == j * k) { can.push_back(make_pair(j, k)); } } } int maxv = 0; for(auto e : can) { for(int x = 0; x <= n - e.first; x++) { for(int y = 0; y <= n - e.second; y++) { int tempv = CalcTotal(d, x, y, e.first, e.second); maxv = maxv < tempv ? tempv : maxv; } } } if(result[i - 1] > maxv) { result[i] = result[i -1]; }else{ result[i] = maxv; } } for(auto e : p) { cout << result[e] << endl; } } int main() { c(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - おいしいたこ焼きの売り方 |
User | umisan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2488 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 |