結果
| 問題 | No.596 郵便配達 |
| ユーザー |
 はむこ
|
| 提出日時 | 2017-10-13 12:34:29 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 8,563 bytes |
| コンパイル時間 | 1,738 ms |
| コンパイル使用メモリ | 180,564 KB |
| 実行使用メモリ | 456,660 KB |
| 最終ジャッジ日時 | 2024-11-17 14:19:46 |
| 合計ジャッジ時間 | 6,751 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 34 ms
62,160 KB |
| testcase_01 | AC | 34 ms
62,032 KB |
| testcase_02 | AC | 2 ms
5,248 KB |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | AC | 739 ms
439,732 KB |
| testcase_06 | WA | - |
| testcase_07 | AC | 2 ms
5,248 KB |
| testcase_08 | AC | 230 ms
105,264 KB |
| testcase_09 | AC | 2 ms
5,248 KB |
| testcase_10 | AC | 2 ms
5,248 KB |
| testcase_11 | WA | - |
| testcase_12 | AC | 2 ms
5,248 KB |
| testcase_13 | AC | 2 ms
5,248 KB |
| testcase_14 | AC | 2 ms
5,248 KB |
| testcase_15 | AC | 1 ms
5,248 KB |
| testcase_16 | WA | - |
| testcase_17 | AC | 2 ms
5,248 KB |
| testcase_18 | AC | 2 ms
5,248 KB |
| testcase_19 | AC | 2 ms
5,248 KB |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
コンパイルメッセージ
main.cpp: In function ‘void vizGraph(vvll&, int, std::string)’:
main.cpp:43:425: warning: ignoring return value of ‘int system(const char*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
43 | void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
| ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#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; }
inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; }
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 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> ostream &operator<<(ostream &o, const priority_queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} o << endl; return o; }
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); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
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 = 1e9;
static const long long mo = 1e9+7;
#define ldout fixed << setprecision(40)
int32_t dp[(ll)7e6+20][3][3];
int main(void) {
ll n, m; cin >> n >> m;
vll x(m), d(m);
vvll y(m);
vll yr(m), yl(m);
vll pos1(n+5), pos2(n+5);
ll l = INF, r = -INF;
ll lx = INF, rx = -INF;
rep(i, m) {
cin >> x[i] >> d[i];
chmin(l, x[i]), chmax(r, x[i]);
rep(j, d[i]) {
ll tmp; cin >> tmp;
y[i].pb(tmp);
chmin(l, tmp), chmax(r, tmp);
chmin(lx, tmp), chmax(rx, tmp);
}
sort(all(y[i]));
if (y[i].back() > x[i]) {
pos1[x[i]]++;
pos1[y[i].back()]--;
}
if (y[i][0] < x[i]) {
pos2[y[i][0]]++;
pos2[x[i]]--;
}
}
rep(i, pos1.size()-1) {
pos1[i+1] += pos1[i];
}
rep(i, pos2.size()-1) {
pos2[i+1] += pos2[i];
}
/*
for (auto pos : {pos1, pos2}) {
ll counter = 0;
for (auto p : pos1) {
counter += !!p * (lx <= p && p <= rx ? 2 : 1);
}
chmin(ret, counter);
}
*/
ll ret = INF;
rep(_, 2) {
vll pos;
if (_ == 0)
pos = pos2;
else {
pos = pos1;
reverse(all(pos));
l = pos.size() - l + 1;
r = pos.size() - r + 1;
swap(l, r);
}
// cout << pos << "#pos"<<endl;
// cout << l << " " << r << endl;
rep(i, n+10) rep(j, 3) rep(h, 3) dp[i][j][h] = INF;
if (pos[l]) {
dp[l][0][0] = INF;
dp[l][0][1] = 1;
dp[l][0][2] = INF;
} else {
dp[l][0][0] = 0;
dp[l][0][1] = 1;
dp[l][0][2] = INF;
}
repi(i, l+1, r) {
rep(j, 3) {
chmin(dp[i][j][2], dp[i-1][j][0] + 2);
chmin(dp[i][j][2], dp[i-1][j][2] + 2);
chmin(dp[i][j][1], dp[i-1][j][1] + 1);
if (j < 2) chmin(dp[i][j+1][1], dp[i-1][j][0] + 1);
if (!pos[i]) {
// cout << i << " " << "hit" << endl;
chmin(dp[i][j][0], dp[i-1][j][0] + 0);
chmin(dp[i][j][0], dp[i-1][j][2] + 0);
if (j < 2) chmin(dp[i][j+1][0], dp[i-1][j][1] + 0);
}
}
rep(j, 3) rep(h, 3) if (dp[i][j][h] != INF) {
// cout << i << " " << j << " " << h << " : "<< dp[i][j][h] << endl;
}
}
rep(j, 3) rep(h, 3) {
chmin(ret, dp[r-1][j][h]);
}
}
cout << ret + r - l << endl;
return 0;
}