Submission #1605326

---

Source Code Expand

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;




ll m, n, kei;
ll width, height, n_q;

vector<pair<int, int>> q_rows;
vector<pair<int, int>> q_cols;

int main() {

    scanner >> width >> height >> n_q;

    q_rows.reserve(n_q + 5);
    q_cols.reserve(n_q + 5);

    repeat(i, n_q) {
        int t, d, x;
        scanner >> t >> d >> x;
        if (d == 0) {
            q_cols.emplace_back(t, x);
        }
        else {
            q_rows.emplace_back(t, x);
        }
    }

    sort(ALL(q_cols));
    sort(ALL(q_rows));

    ll answer = 0;
    {
        vector<ll> dp(width + 2, 0);
        vector<int> tm(width + 2, 0);
        int left = 0;
        for (auto q : q_cols) {
            int t = q.first;
            int x = q.second;
            
            if (tm[x-1] < t) {
                left = x-1;
            }
            {
                minset(dp[left], dp[x] + x-left); // 左に避ける
                minset(dp[x + 1], dp[x] + 1); // 右に避ける
            }
            dp[x] = 5e15;
            tm[x] = t;
            //debugv(dp);
        }
        dp.front() = dp.back() = 5e15;
        answer += *min_element(ALL(dp));
    }

    {
        vector<ll> dp(height + 2, 0);
        vector<int> tm(height + 2, 0);
        int left = 0;
        for (auto q : q_rows) {
            int t = q.first;
            int x = q.second;
            
            if (tm[x-1] < t) {
                left = x-1;
            }
            {
                minset(dp[left], dp[x] + x-left); // 左に避ける
                minset(dp[x + 1], dp[x] + 1); // 右に避ける
            }
            dp[x] = 5e15;
            tm[x] = t;
            //debugv(dp);
        }
        dp.front() = dp.back() = 5e15;
        answer += *min_element(ALL(dp));
    }

    if (answer > 1e15) {
        cout << -1 << endl;
    }
    else {
        cout << answer << endl;
    }


    return 0;
}

Submission Info

Judge Result