結果

問題 No.1675 Strange Minimum Query
ユーザー Focus_SashFocus_Sash
提出日時 2021-09-10 23:18:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 341 ms / 2,000 ms
コード長 4,068 bytes
コンパイル時間 7,452 ms
コンパイル使用メモリ 271,432 KB
実行使用メモリ 38,452 KB
最終ジャッジ日時 2023-09-02 21:43:10
合計ジャッジ時間 15,064 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,368 KB
testcase_01 AC 1 ms
4,368 KB
testcase_02 AC 2 ms
4,372 KB
testcase_03 AC 253 ms
17,136 KB
testcase_04 AC 225 ms
20,460 KB
testcase_05 AC 24 ms
12,252 KB
testcase_06 AC 304 ms
19,368 KB
testcase_07 AC 341 ms
23,892 KB
testcase_08 AC 2 ms
4,372 KB
testcase_09 AC 3 ms
4,368 KB
testcase_10 AC 89 ms
21,440 KB
testcase_11 AC 25 ms
15,048 KB
testcase_12 AC 100 ms
23,156 KB
testcase_13 AC 159 ms
33,776 KB
testcase_14 AC 179 ms
38,452 KB
testcase_15 AC 188 ms
38,376 KB
testcase_16 AC 1 ms
4,372 KB
testcase_17 AC 42 ms
9,448 KB
testcase_18 AC 59 ms
10,684 KB
testcase_19 AC 84 ms
20,092 KB
testcase_20 AC 201 ms
25,012 KB
testcase_21 AC 177 ms
25,516 KB
testcase_22 AC 232 ms
29,344 KB
testcase_23 AC 179 ms
18,208 KB
testcase_24 AC 163 ms
20,172 KB
testcase_25 AC 116 ms
13,996 KB
testcase_26 AC 58 ms
12,304 KB
testcase_27 AC 157 ms
24,712 KB
testcase_28 AC 74 ms
17,952 KB
testcase_29 AC 50 ms
18,244 KB
testcase_30 AC 53 ms
12,340 KB
testcase_31 AC 232 ms
22,688 KB
testcase_32 AC 314 ms
33,876 KB
testcase_33 AC 308 ms
33,940 KB
testcase_34 AC 313 ms
33,780 KB
testcase_35 AC 274 ms
31,372 KB
testcase_36 AC 272 ms
31,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include "bits/stdc++.h"
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using vl = vector<long long>;
using pl = pair<long long, long long>;
struct edge {long long to;long long cost;edge(long long t,long long c):to(t),cost(c){}};
using Graph = vector<vector<long long>>;
using WGraph = vector<vector<edge>>;
constexpr int dx[8]{1,0,-1,0,1,1,-1,-1};
constexpr int dy[8]{0,1,0,-1,1,-1,1,-1};
#define rep(i, n) for(long long (i) = 0; (i) < (n); (i)++)
#define reps(i, a, b) for(long long (i) = (a); (i) < (b); (i)++)
#define rrep(i, a, b) for(long long (i) = (a); (i) >= (b); (i)--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define V vector
constexpr long long MOD1 = 1000000007;
constexpr long long MOD9 =  998244353;
constexpr long long INF = 1000000000;
constexpr long long LL_MAX = std::numeric_limits<long long>::max();
long long safe_mod(long long n, long long m){if(n >= 0) {return n % m;} else return (n%m + m)%m;}
long long div_ceil(long long a, long long b){return (a + b - 1) / b;}
long long pw(long long x,long long n) {ll ret=1;while(n>0){if(n&1){ret=ret*x;}if(n>>=1){x=x*x;}}return ret;}
template<typename T> T SUM(const vector<T> &v){T ret{};return(accumulate(v.begin(), v.end(), ret));}
template<typename T> T MAX(const vector<T> &v){return *max_element(v.begin(), v.end());}
template<typename T> T MIN(const vector<T> &v){return *min_element(v.begin(), v.end());}
template<typename T> T pwmod(T x, long long n, long long m) {T ret=1;while(n>0){if(n&1)ret=ret*x%m;x=x*x%m;n>>=1;}return ret%m;}
template<typename T> void rsort(vector<T> &v) {sort(v.begin(), v.end(), greater<T>());}
template<typename T> bool chmax(T &a, const T& b) {if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a, const T& b) {if(a>b){a=b;return true;}return false;}
template<typename T, typename S> pair<T, S> mp(const T &a, const S &b){return make_pair(a, b);}
template<typename T> void uniquify(vector<T> &v){sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
template<typename T,typename S> ostream&operator<<(ostream&os,const pair<T,S>&p){os<<"("<<p.first<<", "<<p.second<<")";return os;}
template<typename T,typename S> ostream&operator<<(ostream&os,const map<T,S>&ma){for(auto [a,b]:ma){os<<"("<<a<<", "<<b<<")"<<" ";}return os;}
template<typename T> ostream &operator<<(ostream&os,const set<T>&s){os<<"{";for(auto c:s)os<<c<<" ";os<<"}";return os;}
template<typename T> ostream &operator<<(ostream&os,const vector<T>&v){os<<"[";for(int i=0;i<v.size();i++){os<<v[i]<<(i==v.size()-1?"":" ");}os<<"]";return os;}
template<typename T> vector<int> compress(vector<T> &a){
    int n = a.size(); vector<int> ret(n); vector<T> temp = a;
    sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end());
    for(int i = 0; i < n; i++) ret[i] = lower_bound(a.begin(), a.end(), temp[i]) - a.begin();
    return ret;
}

//#define ONLINE_JUDGE
#ifdef ONLINE_JUDGE
#define dump(x) true
#else
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#endif

ll op(ll a, ll b){return min(a, b);}
ll e(){return INF;}

void solve(){
    ll n, q; cin >> n >> q;
    V<vl> L(n+1), R(n+1);
    V<tuple<ll, ll, ll>> Query(q);
    rep(i, q){
        ll l, r, b; cin >> l >> r >> b;
        l--;
        L[l].pb(b);
        R[r].pb(b);
        Query[i] = {l, r, b};
    }
    multiset<ll> rest;
    segtree<ll, op, e> seg(n);
    rest.insert(1);
    rep(i, n){
        for(ll t : R[i]){
            auto iter = rest.find(t);
            rest.erase(iter);
        }
        for(ll t : L[i])
            rest.insert(t);
        seg.set(i, *rest.rbegin());
    }
    rep(i, q){
        auto [l, r, b] = Query[i];
        if(seg.prod(l, r) != b){
            cout << -1 << '\n';
            return;
        }
    }
    rep(i, n){
        cout << seg.get(i);
        if(i != n - 1) cout << ' ';
    }
    cout << '\n';
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(15);

    solve();

    return 0;
}
0