結果
| 問題 | No.3465 Lis! Lis! Lis! |
| コンテスト | |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2026-02-15 23:40:14 |
| 言語 | C++17 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 116 ms / 2,000 ms |
| コード長 | 8,383 bytes |
| 記録 | |
| コンパイル時間 | 2,478 ms |
| コンパイル使用メモリ | 229,396 KB |
| 実行使用メモリ | 19,008 KB |
| 最終ジャッジ日時 | 2026-02-28 13:08:07 |
| 合計ジャッジ時間 | 7,846 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge7 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
using i64 = int64_t;
using i128 = __int128_t;
using ll = long long;
using ul = unsigned long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<long long>;
using vull = vector<unsigned long long>;
using vc = vector<char>;
using vst = vector<string>;
using vd = vector<double>;
using vld = vector<long double>;
using P = pair<long long, long long>;
template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U>
void inGraph(vector<vector<T>> &G, U n, U m, bool directed = true, bool zero_index = true){
G.resize(n);
for(int i = 0; i < m; i++){
int a, b;
cin >> a >> b;
if(!zero_index) a--, b--;
G[a].push_back(b);
if(!directed) G[b].push_back(a);
}
}
template <typename T>
long long binary_search(long long ok, long long ng, T check){
while(abs(ok - ng) > 1){
long long mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
for(int i = 0; i < iter; ++i){
long double mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
long long trisum(long long a, long long b){
if(a > b) return 0;
long long res = ((b - a + 1) * (a + b)) / 2;
return res;
}
template <typename T>
T intpow(T x, int n){
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
template <typename T>
T getDivision(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a / b;
} else if(a < 0 && b > 0){
return a / b - (a % b != 0);
} else if(a >= 0 && b < 0){
return a / b;
} else{
return a / b + (a % b != 0);
}
}
template <typename T>
T getReminder(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a % b;
} else if(a < 0 && b > 0){
return ((a % b) + b) % b;
} else if(a >= 0 && b < 0){
return a % b;
} else{
return (abs(b) - abs(a % b)) % b;
}
}
template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << '\n'; }
void fout(){ cout << endl; }
template<class T, class... Ts> void fout(const T &a, const Ts&... b){ cout << a; ((cout << ' ' << b), ...); cout << endl; }
void debug(){ cerr << '\n'; }
template<class T, class... Ts> void debug(const T &a, const Ts&... b){ cerr << a; ((cout << ' ' << b), ...); cerr << '\n'; }
ll T;
void input(){
in(T);
}
template <typename T>
int LIS(vector<T> a, bool is_strong = true){
const long long INF = 0x1fffffffffffffff;
int n = (int) a.size();
vector<long long> dp(n, INF);
for(int i = 0; i < n; ++i){
if(is_strong) *lower_bound(dp.begin(), dp.end(), a[i]) = a[i];
else *upper_bound(dp.begin(), dp.end(), a[i]) = a[i];
}
return lower_bound(dp.begin(), dp.end(), INF) - dp.begin();
}
bool check(const vll &ans, const vll &l, const vll &r, const vll &k){
ll n = ans.size();
ll m = l.size();
rep(i, n){
if(1 <= ans[i] && ans[i] <= n){
}else{
return false;
}
}
rep(i, m){
vll b;
rep(j, l[i], r[i]){
b.push_back(ans[j]);
}
if(LIS(b) != k[i]){
return false;
}
}
return true;
}
void solve(){
ll n, m; in(n, m);
vll l(m), r(m), k(m);
rep(i, m){
in(l[i], r[i], k[i]);
l[i]--;
}
vll s = {0, n};
vll mink(n, INF);
rep(i, m){
s.push_back(l[i]);
s.push_back(r[i]);
rep(j, l[i], r[i]) chmin(mink[j], k[i]);
}
Sort(s);
UNIQUE(s);
ll len = s.size();
vll okcnt(len - 1, INF), sinv(n + 1);
rep(i, len) sinv[s[i]] = i;
rep(i, len - 1){
chmin(okcnt[i], mink[s[i]]);
chmin(okcnt[i], s[i + 1] - s[i]);
}
vll diff(len);
rep(i, m){
ll li = sinv[l[i]], ri = sinv[r[i]];
ll cs = 0;
rep(j, li, ri){
cs += okcnt[j];
}
if(cs < k[i]){
out("No");
return;
}
ll cur = k[i];
rep(j, li, ri){
ll d = min(cur, okcnt[j]);
if(j != li) diff[j] = d;
cur -= d;
}
}
vll ans(n);
rep(i, len){
ll offset = 0;
if(i != 0){
offset = ans[s[i] - 1] - okcnt[i] + diff[i];
}
// 1, 2, 3, ..., okcnt - 1, okcnt, okcnt, ...
rep(j, s[i], s[i + 1]){
ans[j] = min(j - s[i] + 1, okcnt[i]) + offset;
}
}
{
ll minans = min(ans);
rep(i, n){
ans[i] -= minans;
ans[i] += 1;
}
}
out("Yes");
out(ans);
assert(check(ans, l, r, k));
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
T = 1;
// input();
while(T--) solve();
}