結果
| 問題 | No.759 悪くない忘年会にしような！ |
| ユーザー |
 jell
|
| 提出日時 | 2018-12-07 10:23:08 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 249 ms / 2,000 ms |
| コード長 | 7,231 bytes |
| コンパイル時間 | 1,513 ms |
| コンパイル使用メモリ | 136,344 KB |
| 実行使用メモリ | 10,752 KB |
| 最終ジャッジ日時 | 2024-09-14 03:17:18 |
| 合計ジャッジ時間 | 5,238 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 64 |
コンパイルメッセージ
main.cpp:133:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
133 | i64 bins(i64 ok, i64 ng, auto judge) {
| ^~~~
ソースコード
/*#include <boost/functional/hash.hpp>#include <boost/multiprecision/cpp_int.hpp>typedef boost::multiprecision::cpp_int mlint;*/#include <cassert>#include <deque>#include <queue>#include <stack>#include <algorithm>#include <iostream>#include <set>#include <map>#include <list>#include <cmath>#include <complex>#include <functional>#include <random>#include <unordered_map>#include <unordered_set>#include <bitset>#include <iomanip>using namespace std;typedef int64_t i64;typedef double db;typedef vector<vector<int64_t>> mat;typedef pair<int,int> pii;typedef pair<int64_t,int> pli;typedef pair<db,int> pdi;#define esc(x) cout << (x) << endl,exit(0)#define inf(T) (numeric_limits<T>::max() / 2 - 1)#define each(i,v) for(auto i = begin(v); i != end(v); ++i)#define reach(i,v) for(auto i = rbegin(v); i != rend(v); ++i)#define urep(i,s,t) for(int64_t i = (s); i <= (t); ++i)#define drep(i,s,t) for(int64_t i = (s); i >= (t); --i)#define rep(i,n) urep(i,0,(n) - 1)#define rep1(i,n) urep(i,1,(n))#define rrep(i,n) drep(i,(n) - 1,0)#define all(v) begin(v),end(v)#define rall(v) rbegin(v),rend(v)#define vct vector#define prque priority_queue#define u_map unordered_map#define u_set unordered_set#define l_bnd lower_bound#define u_bnd upper_bound#define rsz resize#define ers erase#define emp emplace#define emf emplace_front#define emb emplace_back#define pof pop_front#define pob pop_back#define mkp make_pair#define mkt make_tuple#define fir first#define sec secondstruct setupper {setupper(uint8_t prec) {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(prec);#ifdef Local#define debug 1#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endlcout << "-- Execution At Local ---\n" << "\n<Standard Output>\n\n";auto print_atexit = []() {time_t end_time = time(NULL);struct tm *ret = localtime(&end_time);cout << "\n----------------\n";cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";};atexit(print_atexit);#endif}} setupper_obj(10);template <class T, class U> ostream& operator << (ostream &s, pair<T,U> p) { return s << p.fir << " " << p.sec; }template <class T> ostream& operator << (ostream &s, vector<T> &v) { for(auto i = v.begin(); i != v.end(); ++i) { if(i != begin(v)) s << " "; s << *i; } return s; }template <class T> void hash_combine(size_t &seed, T const &key) {hash<T> hasher;seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);}namespace std {template <class T, class U> struct hash<pair<T,U>> {size_t operator()(pair<T,U> const &p) const {size_t seed(0);hash_combine(seed,p.first);hash_combine(seed,p.second);return seed;}};template <class T, class U, class V> struct hash<tuple<T,U,V>> {size_t operator()(tuple<T,U,V> const &t) const {size_t seed(0);hash_combine(seed,get<0>(t));hash_combine(seed,get<1>(t));hash_combine(seed,get<2>(t));return seed;}};}const auto add = [](auto &x, auto y) { x += y; };const auto mul = [](auto &x, auto y) { x *= y; };const auto lam_min = [](auto x, auto y) { return min(x,y); };const auto lam_max = [](auto x, auto y) { return max(x,y); };const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };bool odd(i64 x) { return x & 1; }bool even(i64 x) { return !odd(x); }bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }bool bit(i64 n, uint8_t e) { return n >> e & 1; }i64 mask(i64 n, uint8_t e) { return n & (1 << e) - 1; }int ilog(i64 x, uint64_t b = 2) { if(x) return ilog(x / b, b) + 1; return -1; }i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); }i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; }i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {i64 d = a;if(b) {d = extgcd(b,a % b,y,x);y -= (a / b) * x;} else {x = 1,y = 0;}return d;}i64 bins(i64 ok, i64 ng, auto judge) {while(abs(ok - ng) > 1) {i64 mid = ok + ng >> 1;(judge(mid) ? ok : ng) = mid;}return ok;}template <class T> T cmprs(T &v) {T tmp = v,ret = v;sort(all(tmp));tmp.erase(unique(all(tmp)),end(tmp));each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;return ret;}constexpr int dx[9] = {1,0,-1,0,1,-1,-1,1,0};constexpr int dy[9] = {0,1,0,-1,1,1,-1,-1,0};constexpr i64 mod = 1e9 + 7;constexpr db gold = sqrt(1.25) + 0.5;constexpr db eps = 1e-15;template <class Monoid> struct Segtree {typedef function<Monoid(const Monoid&, const Monoid&)> opr_t;typedef function<void(Monoid&, const Monoid&)> update_opr_t;const opr_t opr;const update_opr_t update_opr;const Monoid idel;vector<Monoid> data;const int n;int range;Segtree(int n_, Monoid idel_ = 0, const opr_t &opr_ = plus<Monoid>(), const update_opr_t &update_opr_ = [](Monoid &x,Monoid y){x = y;}) : n(n_),opr(opr_),update_opr(update_opr_),idel(idel_){range = 1;while(n >= range) range <<= 1;data.assign(range << 1,idel);}void copy(const vector<Monoid> &v) {for(int i = 0; i < v.size(); ++i) data[i + range] = v[i];for(int i = range - 1; i; i--) data[i] = opr(data[i * 2],data[i * 2 + 1]);}void update(int idx, Monoid val) {update_opr(data[idx += range],val);while(idx >>= 1) data[idx] = opr(data[idx * 2],data[idx * 2 + 1]);}Monoid query(int a, int b, bool is_first = true) {if(a >= b) return idel;if(is_first) {a += range;b += range;}Monoid left = a & 1 ? data[a++] : idel;Monoid right = b & 1 ? data[--b] : idel;return opr(opr(left,query(a >> 1,b >> 1,false)),right);}int bound(int i, function<bool(Monoid,int)> judge) {int w = 1,rig = i,j = range << 1;i += range;while(i < j) {if(i & 1) {rig += w;if(!judge(data[i],w)) break;i++;}i >>= 1,j >>= 1,w <<= 1;}if(i == j) return n;while(w > 1) {if(judge(data[i <<= 1],w >>= 1)) ++i;else rig -= w;}return min(n,rig - 1);}};int n,p[1<<17],t[1<<17],r[1<<17];int main() {cin>>n;vct<tuple<int,int,int,int>> info;rep(i,n) cin>>p[i]>>t[i]>>r[i];rep(i,n) info.emb(p[i],t[i],r[i],i);sort(rall(info));Segtree<int> sgt(1e4,-1,lam_max,[](int &x,int y){x=max(x,y);});set<int> ans;rep(i,n) {int j=get<3>(info[i]);if(sgt.query(t[j],1e4+1)<r[j]) ans.emp(j+1);sgt.update(t[j],r[j]);}each(i,ans) cout<<*i<<endl;}