結果

問題 No.1024 Children in a Row
ユーザー maroon_kurimaroon_kuri
提出日時 2020-04-11 00:20:12
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 567 ms / 2,000 ms
コード長 6,241 bytes
コンパイル時間 2,205 ms
コンパイル使用メモリ 188,556 KB
実行使用メモリ 71,956 KB
最終ジャッジ日時 2024-09-16 04:20:35
合計ジャッジ時間 14,122 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
os<<t<<" ";
dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif
using uint=unsigned;
using ull=unsigned long long;
template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
return os<<vc<t>(all(a));
}
template<int i,class T>
void print_tuple(ostream&,const T&){
}
template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
if(i)os<<",";
os<<get<i>(t);
print_tuple<i+1,T,Args...>(os,t);
}
template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
os<<"{";
print_tuple<0,tuple<Args...>,Args...>(os,t);
return os<<"}";
}
template<class t>
void print(t x,int suc=1){
cout<<x;
if(suc==1)
cout<<"\n";
if(suc==2)
cout<<" ";
}
ll read(){
ll i;
cin>>i;
return i;
}
vi readvi(int n,int off=0){
vi v(n);
rep(i,n)v[i]=read()+off;
return v;
}
template<class T>
void print(const vector<T>&v,int suc=1){
rep(i,v.size())
print(v[i],i==int(v.size())-1?suc:2);
}
string readString(){
string s;
cin>>s;
return s;
}
template<class T>
T sq(const T& t){
return t*t;
}
//#define CAPITAL
void yes(bool ex=true){
#ifdef CAPITAL
cout<<"YES"<<"\n";
#else
cout<<"Yes"<<"\n";
#endif
if(ex)exit(0);
}
void no(bool ex=true){
#ifdef CAPITAL
cout<<"NO"<<"\n";
#else
cout<<"No"<<"\n";
#endif
if(ex)exit(0);
}
void possible(bool ex=true){
#ifdef CAPITAL
cout<<"POSSIBLE"<<"\n";
#else
cout<<"Possible"<<"\n";
#endif
if(ex)exit(0);
}
void impossible(bool ex=true){
#ifdef CAPITAL
cout<<"IMPOSSIBLE"<<"\n";
#else
cout<<"Impossible"<<"\n";
#endif
if(ex)exit(0);
}
constexpr ll ten(int n){
return n==0?1:ten(n-1)*10;
}
const ll infLL=LLONG_MAX/3;
#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif
int topbit(signed t){
return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
return __builtin_popcount(t);
}
int popcount(ll t){
return __builtin_popcountll(t);
}
bool ispow2(int i){
return i&&(i&-i)==i;
}
ll mask(int i){
return (ll(1)<<i)-1;
}
bool inc(int a,int b,int c){
return a<=b&&b<=c;
}
template<class t> void mkuni(vc<t>&v){
sort(all(v));
v.erase(unique(all(v)),v.ed);
}
ll rand_int(ll l, ll r) { //[l, r]
#ifdef LOCAL
static mt19937_64 gen;
#else
static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
#endif
return uniform_int_distribution<ll>(l, r)(gen);
}
template<class t>
void myshuffle(vc<t>&a){
rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}
template<class t>
int lwb(const vc<t>&v,const t&a){
return lower_bound(all(v),a)-v.bg;
}
//dep,par not verified
//yukicoder no.1024
template<class E>
struct treedfs{
const vvc<E>&g;
const int n;
int cnt;
vi par,dep,in,out;
void dfs(int v,int p,int d){
par[v]=p;
dep[v]=d;
in[v]=cnt++;
for(auto e:g[v])if(e!=p)
dfs(e,v,d+1);
out[v]=cnt;
}
treedfs(const vvc<E>&gg,int r):g(gg),n(si(g)),cnt(0),par(n),dep(n),in(n),out(n){
dfs(r,-1,0);
}
};
template<class t>
struct BIT{
vc<t> buf;
int s;
BIT(int n=0){init(n);}
void init(int n){buf.assign(s=n,0);}
void add(int i,t v){
for(;i<s;i+=(i+1)&(-i-1))
buf[i]+=v;
}
t get(int i){
t res=0;
for(;i>=0;i-=(i+1)&(-i-1))
res+=buf[i];
return res;
}
t sum(int b,int e){
return get(e-1)-get(b-1);
}
int kth(int k){
int res=0;
for(int i=topbit(s);i>=0;i--){
int w=res+(1<<i);
if(w<=s&&buf[w-1]<=k){
k-=buf[w-1];
res=w;
}
}
return res;
}
int kth_helper(int k,int i){
return kth(k+get(i-1));
}
};
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int n,m;cin>>n>>m;
int s=n+m;
vvc<int> idx(n);
rep(i,n)idx[i].pb(i);
vvc<int> t(s);
rep(i,n-1)t[i].pb(i+1);
vc<pi> pos(m);
vi ks(m);
rep(i,m){
int a,b,k;cin>>a>>b>>k;
ks[i]=k;
a--;b--;
int cur=n+i;
pos[i]=pi(a,si(idx[a]));
idx[a].pb(cur);
int par=idx[b].back();
t[par].pb(cur);
}
rep(i,s)reverse(all(t[i]));
treedfs<int> h(t,0);
vi corr(s);
rep(i,n)for(auto j:idx[i])
corr[h.in[j]]=i;
BIT<int> bit(s);
rep(i,n)bit.add(h.in[idx[i].back()],1);
//dmp(t);
rep(i,m){
int a,b;tie(a,b)=pos[i];
if(b==si(idx[a])-1){
bit.add(h.in[idx[a][b]],-1);
bit.add(h.in[idx[a][b-1]],1);
}
int j=idx[a][b];
int w=idx[a][b-1];
//dmp2(j,w);
int ans=-1;
vc<pi> z;
z.eb(0,min(h.in[j],h.in[w]+1));
if(h.in[j]<h.in[w]){
z.eb(h.out[j],h.in[w]+1);
z.eb(h.in[j],h.out[j]);
}else{
z.eb(h.in[j],h.out[j]);
z.eb(h.in[w]+1,h.in[j]);
}
z.eb(max(h.out[j],h.in[w]+1),s);
for(auto u:z){
int sub=bit.sum(u.a,u.b);
//dmp2(u.a,u.b,sub,ks[i]);
if(ks[i]<=sub){
ans=corr[bit.kth_helper(ks[i]-1,u.a)];
break;
}
ks[i]-=sub;
}
print(ans+1);
//exit(0);
if(b==si(idx[a])-1){
bit.add(h.in[idx[a][b]],1);
bit.add(h.in[idx[a][b-1]],-1);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0