#202382 (C++11) No.596 郵便配達

提出ソース

結果

問題	No.596 郵便配達
ユーザー	はむこ
提出日時	2017-09-06 12:37:20
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	8,326 bytes
コンパイル時間	1,588 ms
コンパイル使用メモリ	186,320 KB
実行使用メモリ	97,840 KB
最終ジャッジ日時	2024-11-17 14:12:52
合計ジャッジ時間	9,254 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	AC	1 ms 5,248 KB
testcase_08	AC	937 ms 97,840 KB
testcase_09	WA	-
testcase_10	AC	1 ms 5,248 KB
testcase_11	AC	1 ms 5,248 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	1 ms 5,248 KB
testcase_15	AC	1 ms 5,248 KB
testcase_16	AC	2 ms 5,248 KB
testcase_17	AC	2 ms 5,248 KB
testcase_18	AC	1 ms 5,248 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
#define ZERO(a) memset(a,0,sizeof(a))
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
#define exists find_if
#define forall all_of

using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using Pos = complex<double>;

template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const multiset<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
string bits_to_string(ll input, ll n=64) { string s; rep(i, n) s += '0' + !!(input & (1ll << i)); reverse(all(s)); return s; }

template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
struct ci : public iterator<forward_iterator_tag, ll> { ll n; ci(const ll n) : n(n) { } bool operator==(const ci& x) { return n == x.n; } bool operator!=(const ci& x) { return !(*this == x); } ci &operator++() { n++; return *this; } ll operator*() const { return n; } };

size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
namespace myhash{ const int Bsizes[]={3,9,13,17,21,25,29,33,37,41,45,49,53,57,61,65,69,73,77,81}; const int xor_nums[]={0x100007d1,0x5ff049c9,0x14560859,0x07087fef,0x3e277d49,0x4dba1f17,0x709c5988,0x05904258,0x1aa71872,0x238819b3,0x7b002bb7,0x1cf91302,0x0012290a,0x1083576b,0x76473e49,0x3d86295b,0x20536814,0x08634f4d,0x115405e8,0x0e6359f2}; const int hash_key=xor_nums[rand()%20]; const int mod_key=xor_nums[rand()%20]; template <typename T> struct myhash{ std::size_t operator()(const T& val) const { return (hash<T>{}(val)%mod_key)^hash_key; } }; };
template <typename T> class uset:public std::unordered_set<T,myhash::myhash<T>> { using SET=std::unordered_set<T,myhash::myhash<T>>; public: uset():SET(){SET::rehash(myhash::Bsizes[rand()%20]);} };
uint32_t randxor() { static uint32_t x=1+(uint32_t)random_seed,y=362436069,z=521288629,w=88675123; uint32_t t; t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) ); }
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ gettimeofday(&start, NULL); ios::sync_with_stdio(false); cin.tie(0); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define rand randxor

static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40) 


int main(void) {
    ll n, m; cin >> n >> m;
    map<ll, vll> memo; // fiの家に、seを全て届けなければいけない
    ll leftest_letter = INF, rightest_letter = -INF;
    ll leftest_house = INF, rightest_house = -INF;
    rep(i, m) {
        ll x, d; cin >> x >> d;
        chmax(rightest_letter, x); chmin(leftest_letter, x);
        rep(i, d) {
            ll y; cin >> y; 
            chmax(rightest_house, y); chmin(leftest_house, y);
            memo[y].pb(x);
        }
    }
    for (auto&& v : memo) sort(all(v.se));
//    for (auto&& v : memo) cout << v.fi << " " << v.se << endl;



    ll ret = INF;
    rep(_, 2) {
        vll l, r; // 左からの被覆の長さ、右からの被覆の長さ
        if (_ == 0) { // 右から左に全部の手紙を拾う
            for (auto&& v : memo) {
                if (v.fi <= v.se[0]) { // 手紙が全部右側のものは勝手に配達される
                    l.pb(0);
                    r.pb(0);
                } else {
                    l.pb(v.fi-leftest_letter);
                    r.pb(rightest_house - v.se[0]);
                }
            }
        } else { // 左から右に全部の手紙を拾う
            for (auto&& v : memo) {
                if (v.se.back() <= v.fi) { // 手紙が全部右側のものは勝手に配達される
                    l.pb(0);
                    r.pb(0);
                } else {
                    l.pb(rightest_letter-v.fi);
                    r.pb(v.se.back() - leftest_house);
                }
            }
        }

        // l, rから各添字どちらかから1個ずつ取った時に、lから取ったもののmax+rから取ったもののmaxを最小化する問題
        vector<P> lr; rep(i, l.size()) lr.pb(P(l[i], r[i]));
        sort(all(lr));

        multiset<ll> l_set, r_set;
        rep(i, lr.size()) r_set.insert(r[i]);
        /*
        if (l.size() < 100) {
            cout << l << endl;
            cout << r << endl;
        }
        */

        ll minsum = *r_set.rbegin();
        rep(i, lr.size()) {
            r_set.erase(r_set.lower_bound(lr[i].se));
            l_set.insert(lr[i].fi);
            if (r_set.size())
                chmin(minsum, *r_set.rbegin()+*l_set.rbegin());
        }
        chmin(minsum, *l_set.rbegin());

//        cout << minsum << " " << rightest_letter << " " << leftest_letter << " " << rightest_house << " " << leftest_house << endl;
        if (_ == 0) {
            chmin(ret, minsum + rightest_letter - leftest_house);
        } else {
            chmin(ret, minsum + rightest_house - leftest_letter);
        }
    }


    cout << ret << endl;

    return 0;
}

yukicoder

結果

テストケース

ソースコード