zcmimi's blog
avatar
zc
2020-01-18 22:40:00
  • 本文总阅读量
查看原题

点击跳转

x>y,看成x\rightarrow y的一条边

若最后的图出现环的话那就是不合法的

但是如果按照普通的建图方式的话每次要添加k(r-l-1-k)条边

我们可以线段树优化建图

因为k \le 3 \times 10^5

所以整个区间最多被划分成3\times 10^5

log n的复杂度是可以接受的

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i(x);i<=y;++i)
    #define Fdr(i,x,y) for(int i(x);i>=y;--i)
    #define fl(i,x) for(int i(head[x]),to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) ((int)(log2(n)))
    #define inf 2122219134
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
#define N 200011<<3
int n,s,q,cnt=0,a[N],pos[N],head[N],deg[N],sz=0,bl[N],d[N],len=0;
struct edge{
    int to,nxt;
}e[N];
void add(int x,int y){
    e[++cnt].to=y;e[cnt].nxt=head[x];head[x]=cnt;
    ++deg[y];
}
#define ls rt<<1
#define rs rt<<1|1
void build(int l,int r,int rt){
    sz=MAX(sz,rt);
    if(l==r){
        bl[rt]=l;
        pos[l]=rt;
        return;
    }
    int m=(l+r)>>1;
    add(rt,ls);
    add(rt,rs);
    build(l,m,ls);
    build(m+1,r,rs);
}
void upd(int L,int R,int p,int l,int r,int rt){
    if(L>R)return;
    if(L<=l&&r<=R){
        add(p,rt);
        return;
    }
    int m=(l+r)>>1;
    if(L<=m)upd(L,R,p,l,m,ls);
    if(R>m)upd(L,R,p,m+1,r,rs);
}
il void ext(){cout<<"NIE\n";exit(0);}
void topsort(){
    queue<int>q;
    q.push(1);
    a[1]=1e9;
    clr(d,127);
    while(!q.empty()){
        int x=q.front();q.pop();
        fl(i,x){
            d[to]=MIN(d[to],a[x]-(bl[to]!=0));
            if(d[to]<a[to])ext();
            if(!--deg[to]){
                if(bl[to])++len;
                q.push(to);
                if(!a[to])a[to]=d[to];
            }
        }
    }
}
int main(){
    int x,y,t,l,r,k;
    in(n,t,q);
    build(1,n,1);
    while(t--){
        in(x,y);
        a[pos[x]]=y;
    }
    while(q--){
        in(l,r,k);
        int la=l;
        ++sz;
        while(k--){
            in(x);
            add(pos[x],sz);
            upd(la,x-1,sz,1,n,1);
            la=x+1;
        }
        upd(la,r,sz,1,n,1);
    }
    topsort();
    if(len!=n)ext();
    out("TAK\n");
    Fur(i,1,n)out(a[pos[i]]," ");
    flush();
}
LG 3588 [POI2015]PUS
comment评论
Search
search