結果

問題 No.1675 Strange Minimum Query
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-09-10 21:37:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 5,816 bytes
コンパイル時間 3,575 ms
コンパイル使用メモリ 206,724 KB
実行使用メモリ 22,996 KB
最終ジャッジ日時 2024-06-11 22:48:44
合計ジャッジ時間 11,527 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 71 ms
8,560 KB
testcase_04 AC 81 ms
11,008 KB
testcase_05 AC 43 ms
9,856 KB
testcase_06 AC 85 ms
9,216 KB
testcase_07 AC 96 ms
11,400 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 3 ms
5,376 KB
testcase_10 AC 137 ms
17,152 KB
testcase_11 AC 62 ms
14,840 KB
testcase_12 AC 157 ms
18,308 KB
testcase_13 AC 149 ms
18,872 KB
testcase_14 AC 176 ms
18,816 KB
testcase_15 AC 168 ms
18,816 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 36 ms
6,784 KB
testcase_18 AC 46 ms
7,424 KB
testcase_19 AC 99 ms
13,952 KB
testcase_20 AC 133 ms
13,920 KB
testcase_21 AC 142 ms
19,840 KB
testcase_22 AC 166 ms
17,152 KB
testcase_23 AC 103 ms
9,984 KB
testcase_24 AC 113 ms
12,288 KB
testcase_25 AC 72 ms
8,320 KB
testcase_26 AC 52 ms
8,704 KB
testcase_27 AC 136 ms
20,096 KB
testcase_28 AC 81 ms
11,904 KB
testcase_29 AC 85 ms
13,056 KB
testcase_30 AC 54 ms
8,832 KB
testcase_31 AC 133 ms
13,568 KB
testcase_32 AC 205 ms
22,996 KB
testcase_33 AC 205 ms
22,992 KB
testcase_34 AC 204 ms
22,912 KB
testcase_35 AC 204 ms
18,800 KB
testcase_36 AC 206 ms
18,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:196:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  196 |   for(auto&[c,l,r]:edge){
      |            ^
main.cpp:201:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  201 |   for(auto[c,l,r]:edge){
      |           ^
main.cpp:209:11: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  209 |   for(auto[c,l,r]:edge){
      |           ^

ソースコード

diff # 

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
using datas=pair<ll,ll>;
using ddatas=pair<long double,long double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v),(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define popcount __builtin_popcountll
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr long double eps=1e-9;
const long double PI=acosl(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

inline void startupcpp(void) noexcept{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

ll modinv(ll a,const ll m=mod) noexcept{
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(const ll a,const ll b) noexcept{return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(const ll n,const ll r) noexcept{
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1)modncrlistp[i]=modncrlistp[i-1]*i%mod;
    modncrlistm[n]=modinv(modncrlistp[n]);
    for(i=n;i>size;--i)modncrlistm[i-1]=modncrlistm[i]*i%mod;
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,const ll m=mod){
  if(n<0)return 0;
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

constexpr ll gcd(const ll a,const ll b) noexcept{return (!b)?abs(a):(a%b==0)?abs(b):gcd(b,a%b);}
constexpr ll lcm(const ll a,const ll b) noexcept{return a/gcd(a,b)*b;}

template<typename T> struct segtree{
private:
  int N=1;
  T E;
  using func=function<T(T,T)>;
  func f,g;
  vector<T> tree;
public:
  segtree(){}
  segtree(vector<T>& v,T e,func Merge,func Act):E(e),f(Merge),g(Act){
    int i,K=v.size();
    while(N<K)N<<=1;
    tree.resize(N<<1);
    For(i,N,N+K)tree[i]=v[i-N];
    For(i,N+K,N<<1)tree[i]=E;
    brep1(i,N)tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
  }
  segtree(vector<T>& v,T e,func Merge){*this=segtree(v,e,Merge,Merge);};
  segtree(int N,T e,func F){
    vector<T> res(N,e);
    *this=segtree(res,e,F);
  }
  void action(int i,T a){
    if((i<0)|(i>=N))return;
    i|=N;
    tree[i]=g(tree[i],a);
    while(i>1){
      i>>=1;
      tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
    }
  }
  void set(int i,T a){
    if((i<0)|(i>=N))return;
    tree[i|=N]=a;
    while(i>1){
      i>>=1;
      tree[i]=f(tree[i<<1],tree[(i<<1)|1]);
    }
  }
  T prod(int a,int b){
    if((a>=b)|(a<0)|(b<=0)|(a>=N)|(b>N))return E;
    T l(E),r(E);
    for(a|=N,b+=N;a<b;a>>=1,b>>=1){
      if(a&1)l=f(l,tree[a++]);
      if(b&1)r=f(tree[--b],r);
    }
    return f(l,r);
  }
};

ll N,M,K,H,W,A,B,C,D;
string s,t;
ll ans;
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N>>K;
  set<ll> se;
  rep(i,N)se.emplace(i);
  vec v(N,1);
  vector<tuple<ll,ll,ll>> edge(K);
  for(auto&[c,l,r]:edge){
    cin>>l>>r>>c;
    --l;
  }
  vrsort(edge);
  for(auto[c,l,r]:edge){
    auto itr=se.lower_bound(l);
    while(itr!=se.end()&&*itr<r){
      v[*itr]=c;
      itr=se.erase(itr);
    }
  }
  segtree<ll> ch(v,inf,[](ll a,ll b){return min(a,b);});
  for(auto[c,l,r]:edge){
    if(ch.prod(l,r)!=c){
      print(-1);
      return 0;
    }
  }
  output(v);
}
0