結果
| 問題 | No.1675 Strange Minimum Query |
| ユーザー |
 bond_cmprog
|
| 提出日時 | 2021-09-10 22:54:42 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 402 ms / 2,000 ms |
| コード長 | 9,737 bytes |
| コンパイル時間 | 6,043 ms |
| コンパイル使用メモリ | 271,900 KB |
| 実行使用メモリ | 34,564 KB |
| 最終ジャッジ日時 | 2023-09-02 20:21:41 |
| 合計ジャッジ時間 | 15,923 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,372 KB |
| testcase_01 | AC | 1 ms
4,372 KB |
| testcase_02 | AC | 2 ms
4,372 KB |
| testcase_03 | AC | 234 ms
15,500 KB |
| testcase_04 | AC | 216 ms
20,036 KB |
| testcase_05 | AC | 18 ms
12,572 KB |
| testcase_06 | AC | 289 ms
17,692 KB |
| testcase_07 | AC | 327 ms
22,832 KB |
| testcase_08 | AC | 2 ms
4,372 KB |
| testcase_09 | AC | 2 ms
4,368 KB |
| testcase_10 | AC | 80 ms
20,924 KB |
| testcase_11 | AC | 24 ms
14,820 KB |
| testcase_12 | AC | 89 ms
22,528 KB |
| testcase_13 | AC | 158 ms
29,572 KB |
| testcase_14 | AC | 184 ms
34,564 KB |
| testcase_15 | AC | 177 ms
34,260 KB |
| testcase_16 | AC | 1 ms
4,372 KB |
| testcase_17 | AC | 44 ms
9,604 KB |
| testcase_18 | AC | 64 ms
10,740 KB |
| testcase_19 | AC | 80 ms
20,612 KB |
| testcase_20 | AC | 237 ms
25,176 KB |
| testcase_21 | AC | 192 ms
26,132 KB |
| testcase_22 | AC | 284 ms
29,504 KB |
| testcase_23 | AC | 216 ms
16,632 KB |
| testcase_24 | AC | 190 ms
20,436 KB |
| testcase_25 | AC | 132 ms
13,840 KB |
| testcase_26 | AC | 59 ms
12,636 KB |
| testcase_27 | AC | 165 ms
25,612 KB |
| testcase_28 | AC | 75 ms
18,460 KB |
| testcase_29 | AC | 49 ms
18,624 KB |
| testcase_30 | AC | 55 ms
12,716 KB |
| testcase_31 | AC | 300 ms
22,044 KB |
| testcase_32 | AC | 402 ms
33,824 KB |
| testcase_33 | AC | 398 ms
33,852 KB |
| testcase_34 | AC | 401 ms
33,776 KB |
| testcase_35 | AC | 275 ms
29,752 KB |
| testcase_36 | AC | 269 ms
29,684 KB |
ソースコード
#include <stdio.h>
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint = boost::multiprecision::cpp_int;
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
inline constexpr ll ceil_div(const ll a, const ll b) {return (a + b - 1) / b - !!((a + b - 1) % b < 0);}// return ceil(a/b)
inline constexpr ll floor_div(const ll a, const ll b) {return a / b - !!(a % b < 0);}// return floor(a/b)
/* ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template <class T> void dump_function(const vector<T> &);
template <class T, size_t size> void dump_function(const array<T, size> &);
template <class T, class L> void dump_function(const pair<T, L> &p);
template <class T, size_t size> void dump_function(const T (&)[size]);
template <class T> void dump_function(const vector<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
DUMPOUT << endl;
}
template <class T> void dump_function(const deque<T> &a) {
if(a.empty()) return;
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, size_t size> void dump_function(const array<T, size> &a) {
dump_function(a[0]);
for(auto i = a.begin(); ++i != a.end();) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T, class L> void dump_function(const pair<T, L> &p) {
DUMPOUT << '(';
dump_function(p.first);
DUMPOUT << ",";
dump_function(p.second);
DUMPOUT << ')';
}
template <class T> void dump_function(set<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T> void dump_function(multiset<T> &x) {
for(auto e : x) dump_function(e), DUMPOUT << " ";
DUMPOUT << endl;
}
template <class T, size_t size> void dump_function(const T (&a)[size]) {
dump_function(a[0]);
for(auto i = a; ++i != end(a);) {
DUMPOUT << " ";
dump_function(*i);
}
}
template <class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
DUMPOUT << '\n';
return 0;
}
template <class T> int dump_out(const T &t) {
dump_function(t);
DUMPOUT << '\n';
return 0;
}
template <class Head, class... Tail> int dump_out(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
return 0;
}
#ifdef DEBUG_
#define dump(x) \
DUMPOUT << #x << ": "; \
dump_function(x); \
DUMPOUT << endl;
void dumps() {}
template <class T> void dumps(const T &t) {
dump_function(t);
DUMPOUT << " ";
}
template <class Head, class... Tail> void dumps(const Head &head, const Tail &... tail) {
dump_function(head);
DUMPOUT << ' ';
dump_out(tail...);
}
#else
#define dump(x)
template <class... T> void dumps(const T &...) {}
#endif
/* ----------------------- DEBUG FUNCTION ---------------------------- */
template<int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0) val += MOD;
}
constexpr int getmod() const { return MOD; }
constexpr Fp operator - () const noexcept {
return val ? MOD - val : 0;
}
constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
constexpr Fp& operator += (const Fp& r) noexcept {
val += r.val;
if (val >= MOD) val -= MOD;
return *this;
}
constexpr Fp& operator -= (const Fp& r) noexcept {
val -= r.val;
if (val < 0) val += MOD;
return *this;
}
constexpr Fp& operator *= (const Fp& r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp& operator /= (const Fp& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
val = val * u % MOD;
if (val < 0) val += MOD;
return *this;
}
constexpr bool operator == (const Fp& r) const noexcept {
return this->val == r.val;
}
constexpr bool operator != (const Fp& r) const noexcept {
return this->val != r.val;
}
friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
is >> x.val;
x.val %= MOD;
if (x.val < 0) x.val += MOD;
return is;
}
friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
if (n == 0) return 1;
auto t = modpow(r, n / 2);
t = t * t;
if (n & 1) t = t * r;
return t;
}
friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b, swap(a, b);
u -= t * v, swap(u, v);
}
return Fp<MOD>(u);
}
};
template<class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for(int i = 2; i < n; i++){
fact_[i] = fact_[i-1] * i;
inv_[i] = -inv_[MOD%i] * (MOD/i);
finv_[i] = finv_[i-1] * inv_[i];
}
}
constexpr T nCr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
int MOD = fact_[0].getmod();
if(n < MOD) return fact_[n] * finv_[k] * finv_[n-k];
// Lucasの定理
T ret = 1;
while(n || k){
int _n = n % MOD, _k = k % MOD;
n /= MOD;
k /= MOD;
ret *= nCr(_n, _k);
}
return ret;
}
constexpr T nPr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0) return 0;
return fact_[n] * finv_[n-k];
}
constexpr T nHr(int n, int k) const noexcept {
if (n <= 0 || k < 0) return 0;
return nCr(n + k - 1, k);
}
constexpr T fact(int n) const noexcept {
if (n < 0) return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0) return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0) return 0;
return finv_[n];
}
};
/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD2>;
BiCoef<mint> bc;
// using vec = vector<int>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */
/* ----------------------- AtCoder Library ---------------------------- */
#include <atcoder/all>
using namespace atcoder;
/* ----------------------- AtCoder Library ---------------------------- */
using S = long long;
S op(S a, S b){ return std::min(a, b); }
S e(){ return LINF; }
void solve(){
int N, Q;
cin >> N >> Q;
vector<int> l(Q), r(Q), B(Q), idx(Q);
vector<vector<pair<int, int>>> st(N), en(N);
REP(i,Q){
cin >> l[i] >> r[i] >> B[i];
--l[i], --r[i];
st[l[i]].emplace_back(B[i], i);
en[r[i]].emplace_back(B[i], i);
}
multiset<pair<int, int>, greater<>> mst;
vector<ll> A(N, INF);
REP(i,N){
for(auto [x, idx] : st[i]) mst.insert({x, idx});
if(mst.empty()) continue;
auto [x, idx] = *mst.begin();
A[i] = x;
for(auto [x, idx] : en[i]) mst.erase(mst.find({x, idx}));
}
segtree<S, op, e> seg(A);
REP(i,Q){
int mi = seg.prod(l[i], r[i] + 1);
if(mi > B[i]){
cout << -1 << endl;
return;
}
}
REP(i,N) cout << A[i] << (i == N - 1 ? "" : " ");
cout << endl;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
solve();
// int T; cin >> T; REP(t,T) solve();
}