AtCoder Beginner Contest 005

Submission #6898623

Source codeソースコード

#define DEBUG 1
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using tll = tuple<ll, ll, ll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor1(i, n) for (ll i = 0; i > (n); i--)
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define INF (1LL << 60)
#if DEBUG
#define dump(v1) dump_1(#v1, v1)
#define dump2(v1, v2) dump_2(#v1, v1, #v2, v2)
#define dump3(v1, v2, v3) dump_3(#v1, v1, #v2, v2, #v3, v3)
#define dump4(v1, v2, v3, v4) dump_4(#v1, v1, #v2, v2, #v3, v3, #v4, v4)
#else
#define dump(v1)
#define dump2(v1, v2)
#define dump3(v1, v2, v3)
#define dump4(v1, v2, v3, v4)
#endif
#if DEBUG
template <typename T>
void dump_1(const string& n1, const T& v1)
{
    cerr << n1 << ": " << v1 << endl;
}
template <typename T1, typename T2>
void dump_2(const string& n1, const T1& v1, const string& n2, const T2& v2)
{
    cerr << n1 << ": " << v1 << "  " << n2 << ": " << v2 << endl;
}
template <typename T1, typename T2, typename T3>
void dump_3(const string& n1, const T1& v1, const string& n2, const T2& v2,
            const string& n3, const T3& v3)
{
    cerr << n1 << ": " << v1 << "  " << n2 << ": " << v2 << "  " << n3 << ": "
         << v3 << endl;
}
template <typename T1, typename T2, typename T3, typename T4>
void dump_4(const string& n1, const T1& v1, const string& n2, const T2& v2,
            const string& n3, const T3& v3, const string& n4, const T4& v4)
{
    cerr << n1 << ": " << v1 << "  " << n2 << ": " << v2 << "  " << n3 << ": "
         << v3 << "  " << n4 << ": " << v4 << endl;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v)
{
    os << "(" << v.first << ", " << v.second << ")";
    return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v)
{
    os << "(" << get<0>(v) << ", " << get<1>(v) << ", " << get<2>(v) << ")";
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << " ";
        }
        os << *it;
    }
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v)
{
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << " ";
        }
        os << *it;
    }
    return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v)
{
    os << "{";
    for (auto it = v.begin(); it != v.end(); it++) {
        if (it != v.begin()) {
            os << ", ";
        }
        os << it->first << ":" << it->second;
    }
    os << "}";
    return os;
}
#endif  // DEBUG
void Yes(void) { cout << "Yes" << endl; }
void No(void) { cout << "No" << endl; }
void YES(void) { cout << "YES" << endl; }
void NO(void) { cout << "NO" << endl; }
template <typename T>
void vin(vector<T>& v, ll len)
{
    for1 (i, len) {
        cin >> v[i];
    }
}
template <typename T>
void print(const T& v)
{
    cout << v << endl;
}
//---------------------------------------------------------
void solve()
{
    ll T, N, M;
    cin >> T;
    cin >> N;
    vll A(N);
    vin(A, N);
    cin >> M;
    vll B(M);
    vin(B, M);
    ll j = 0;
    for1 (i, M) {
        if (j == N) {
            print("no");
            return;
        }
        while (B[i] - A[j] > T) {
            ++j;
            if (j == N) {
                print("no");
                return;
            }
        }
        if (B[i] - A[j] < 0) {
            print("no");
            return;
        }
        ++j;
    }
    print("yes");
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();
}

Submission

Task問題 C - おいしいたこ焼きの売り方
User nameユーザ名 tomarint
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 4372 Byte
File nameファイル名
Exec time実行時間 1 ms
Memory usageメモリ使用量 256 KB

Test case

Set

Set name Score得点 / Max score Cases
All 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
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