oj.uz

Submission #1077636

# Submission time Handle Problem Language Result Execution time Memory
1077636 2024-08-27T08:28:09 Z BABY_GANGSTER Jail (JOI22_jail) C++14
49 / 100
 5000 ms 856888 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
//#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void phongbeo();
const int inf=1e9;
const int mod2=1e9+7;
const int  mod1=998244353;
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a,b,c,d;
};
struct ie
{
    int a,b,c,d,e;

};

int n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,dem4,l,r,mid;
int  i,s10,s12;
int kk;
int el=29;
#define getchar_unlocked getchar

inline int scan(){
    char c = getchar_unlocked();
    int x = 0;
    while(c<'0'||c>'9'){
        c=getchar_unlocked();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+c-'0';
        c=getchar_unlocked();
    }
    return x;
}
main()
{
#ifndef ONLINE_JUDGE
//fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
   int xx=scan();
  //  modwwe
  while(xx--)
    phongbeo(),down
//checktime
}
const int N=2e5+10;
int depth[N];
int head[N];
int pos[N];
int tout[N];
vector<int> v2[N];
vector<ib> v[N*4][2];
int heavy[N];
ib a[N];
int f[N];
int sz[N];
int mxz[N];
int c[N*4][2];
int par[N*4];
void dfs(int x,int y)
{
    sz[x]=1;
    mxz[x]=0;
    par[x]=y;
    depth[x]=depth[y]+1;
    for(auto f:v2[x])
    {
        if(f!=y)
        {
            dfs(f,x);
            sz[x]+=sz[f];
            if(sz[f]>sz[x])
                heavy[x]=f,mxz[x]=sz[f];
        }
    }
}

void des(int x,int y)
{
    head[x]=y;
    pos[x]=++dem;
    if(heavy[x]!=0)
        des(heavy[x],y);
    for(auto f:v2[x])
        if(pos[f]==0)
            des(f,f);
            tout[x]=dem;
}
struct IT
{
    void setup(int node,int l,int r)
    {
  //  cout<<node<<" "<<l<<" "<<r,debug
            if(node!=1)v[node>>1][0].pb({node,0});
        if(node!=1) v[node][1].pb({node>>1,1});
        if(l==r)
        {
            f[l]=node;
            return;
        }
        int mid=l+r>>1;
        setup(node<<1,l,mid);
        setup(node<<1|1,mid+1,r);
    }
      void upd(int node,int l,int r,int l1,int r1,int x)
    {
        if(l>=l1&&r<=r1)
        {
            v[x][0].pb({node,0});
          //  cout<<x<<" "<<node<<" "<<0,down
         //   if(x==5) cout<<node,debug
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid)upd(node<<1,l,mid,l1,r1,x);
        if(r1>=mid+1) upd(node<<1|1,mid+1,r,l1,r1,x);

    }
    void upd2(int node,int l,int r,int l1,int r1,int x)
 {
        if(l>=l1&&r<=r1)
        {
            v[node][1].pb({x,0});
            return;
        }
        int mid=l+r>>1;
        if(l1<=mid)upd2(node<<1,l,mid,l1,r1,x);
        if(r1>=mid+1)upd2(node<<1|1,mid+1,r,l1,r1,x);
 }
    void upd_hld(int u, int v, int i,int dd){
   while (head[u]!=head[v]){
      if (depth[head[u]]<depth[head[v]]) swap(u, v);
      upd(1, 1, n, pos[head[u]], pos[u], i);
      u=par[head[u]];
   }
   if (depth[u]>depth[v]) swap(u, v);
   upd(1, 1, n, pos[u]+dd, pos[v], i);
}
void upd_hld2(int u, int v, int i,int dd){
   while (head[u]!=head[v]){
      if (depth[head[u]]<depth[head[v]]) swap(u, v);
      upd2(1, 1, n, pos[head[u]], pos[u], i);
      u=par[head[u]];
   }
   if (depth[u]>depth[v]) swap(u, v);
   if(pos[u]+dd<=pos[v])
   upd2(1, 1, n, pos[u]+dd, pos[v], i);
}
} stt;
bool de;
bool check(int x,int y)
{
     if(pos[x]<=pos[y]&&tout[x]>=pos[y]) return 1;
      return 0;
}
void dfs2(int x,int y)
{
     c[x][y]=1;
     for(auto f:v[x][y]){
     if(f.b==0&&c[f.a][0]==1){de=1; return;}
      if(c[f.a][f.b]) continue;
      dfs2(f.a,f.b);
      if(de)return;
     }
     c[x][y]=2;
}

void phongbeo()
{
n=scan();
    /// cach 1
    de=0;
    dem=0;
    for(int i=1; i<=n; i++)
        v2[i].clear(),f[i]=0,heavy[i]=0,pos[i]=0,head[i]=0,depth[i]=0;
    for(int i=1; i<=n*4; i++)
        v[i][0].clear(),v[i][1].clear(),c[i][0]=c[i][1]=0;
    for(int i=1; i<n; i++)
       l=scan(),r=scan(),v2[l].pb(r),v2[r].pb(l);
    dfs(1,0);
    des(1,0);
    stt.setup(1,1,n);
m=scan();
    for(int i=1; i<=m; i++){
       a[i].a=scan(),a[i].b=scan();
       v[f[pos[a[i].a]]][0].pb({f[pos[a[i].b]],1});
       if(check(a[i].a,a[i].b)){
   stt.upd_hld(a[i].a,par[a[i].b],f[pos[a[i].a]],1);}
   else if(check(a[i].b,a[i].a)){
        stt.upd_hld(par[a[i].a],a[i].b,f[pos[a[i].a]],1);}
   else {
        stt.upd_hld(par[a[i].a],par[a[i].b],f[pos[a[i].a]],0);}
    if(check(a[i].b,a[i].a))
        stt.upd_hld2(a[i].a,a[i].b,f[pos[a[i].a]],1);
    else stt.upd_hld2(a[i].a,par[a[i].b],f[pos[a[i].a]],0);
       }
 if(n>=120000) assert(0);
 dem=0;
    for(int i=1; i<=m; i++)
    {

        if(!c[f[pos[a[i].a]]][0]) dfs2(f[pos[a[i].a]],0);
        if(de)break;
    }


    if(de) cout<<"No";
    else cout<<"Yes";
}

Compilation message

jail.cpp:63:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   63 | main()
      | ^~~~
jail.cpp: In function 'void des(int, int)':
jail.cpp:115:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  115 |         if(pos[f]==0)
      |         ^~
jail.cpp:117:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  117 |             tout[x]=dem;
      |             ^~~~
jail.cpp: In member function 'void IT::setup(int, int, int)':
jail.cpp:131:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  131 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd(int, int, int, int, int, int)':
jail.cpp:144:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  144 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd2(int, int, int, int, int, int)':
jail.cpp:156:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  156 |         int mid=l+r>>1;
      |                 ~^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 45404 KB Output is correct
2 Correct 19 ms 45404 KB Output is correct
3 Correct 18 ms 45404 KB Output is correct
4 Correct 22 ms 45660 KB Output is correct
5 Correct 30 ms 45660 KB Output is correct
6 Correct 20 ms 45656 KB Output is correct
7 Correct 19 ms 45660 KB Output is correct
8 Correct 22 ms 46168 KB Output is correct
9 Correct 1249 ms 144532 KB Output is correct
10 Execution timed out 5090 ms 837268 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45652 KB Output is correct
2 Correct 19 ms 45548 KB Output is correct
3 Correct 18 ms 45620 KB Output is correct
4 Correct 20 ms 45708 KB Output is correct
5 Correct 21 ms 45524 KB Output is correct
6 Correct 17 ms 45656 KB Output is correct
7 Correct 20 ms 45660 KB Output is correct
8 Correct 19 ms 45656 KB Output is correct
9 Correct 19 ms 45660 KB Output is correct
10 Correct 19 ms 45488 KB Output is correct
11 Correct 22 ms 45660 KB Output is correct
12 Correct 19 ms 45660 KB Output is correct
13 Correct 18 ms 45624 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45652 KB Output is correct
2 Correct 19 ms 45548 KB Output is correct
3 Correct 18 ms 45620 KB Output is correct
4 Correct 20 ms 45708 KB Output is correct
5 Correct 21 ms 45524 KB Output is correct
6 Correct 17 ms 45656 KB Output is correct
7 Correct 20 ms 45660 KB Output is correct
8 Correct 19 ms 45656 KB Output is correct
9 Correct 19 ms 45660 KB Output is correct
10 Correct 19 ms 45488 KB Output is correct
11 Correct 22 ms 45660 KB Output is correct
12 Correct 19 ms 45660 KB Output is correct
13 Correct 18 ms 45624 KB Output is correct
14 Correct 18 ms 45404 KB Output is correct
15 Correct 19 ms 45652 KB Output is correct
16 Correct 19 ms 45768 KB Output is correct
17 Correct 19 ms 45660 KB Output is correct
18 Correct 17 ms 45656 KB Output is correct
19 Correct 17 ms 45656 KB Output is correct
20 Correct 18 ms 45660 KB Output is correct
21 Correct 19 ms 45660 KB Output is correct
22 Correct 22 ms 45660 KB Output is correct
23 Correct 18 ms 45400 KB Output is correct
24 Correct 19 ms 45656 KB Output is correct
25 Correct 21 ms 45688 KB Output is correct
26 Correct 19 ms 45660 KB Output is correct
27 Correct 19 ms 45632 KB Output is correct
28 Correct 19 ms 45400 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45652 KB Output is correct
2 Correct 19 ms 45548 KB Output is correct
3 Correct 18 ms 45620 KB Output is correct
4 Correct 20 ms 45708 KB Output is correct
5 Correct 21 ms 45524 KB Output is correct
6 Correct 17 ms 45656 KB Output is correct
7 Correct 20 ms 45660 KB Output is correct
8 Correct 19 ms 45656 KB Output is correct
9 Correct 19 ms 45660 KB Output is correct
10 Correct 19 ms 45488 KB Output is correct
11 Correct 22 ms 45660 KB Output is correct
12 Correct 19 ms 45660 KB Output is correct
13 Correct 18 ms 45624 KB Output is correct
14 Correct 18 ms 45404 KB Output is correct
15 Correct 19 ms 45652 KB Output is correct
16 Correct 19 ms 45768 KB Output is correct
17 Correct 19 ms 45660 KB Output is correct
18 Correct 17 ms 45656 KB Output is correct
19 Correct 17 ms 45656 KB Output is correct
20 Correct 18 ms 45660 KB Output is correct
21 Correct 19 ms 45660 KB Output is correct
22 Correct 22 ms 45660 KB Output is correct
23 Correct 18 ms 45400 KB Output is correct
24 Correct 19 ms 45656 KB Output is correct
25 Correct 21 ms 45688 KB Output is correct
26 Correct 19 ms 45660 KB Output is correct
27 Correct 19 ms 45632 KB Output is correct
28 Correct 19 ms 45400 KB Output is correct
29 Correct 22 ms 46168 KB Output is correct
30 Correct 20 ms 45656 KB Output is correct
31 Correct 21 ms 45776 KB Output is correct
32 Correct 21 ms 45660 KB Output is correct
33 Correct 19 ms 45660 KB Output is correct
34 Correct 20 ms 45520 KB Output is correct
35 Correct 24 ms 45660 KB Output is correct
36 Correct 18 ms 45660 KB Output is correct
37 Correct 19 ms 45660 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 45652 KB Output is correct
2 Correct 19 ms 45548 KB Output is correct
3 Correct 18 ms 45620 KB Output is correct
4 Correct 20 ms 45708 KB Output is correct
5 Correct 21 ms 45524 KB Output is correct
6 Correct 17 ms 45656 KB Output is correct
7 Correct 20 ms 45660 KB Output is correct
8 Correct 19 ms 45656 KB Output is correct
9 Correct 19 ms 45660 KB Output is correct
10 Correct 19 ms 45488 KB Output is correct
11 Correct 22 ms 45660 KB Output is correct
12 Correct 19 ms 45660 KB Output is correct
13 Correct 18 ms 45624 KB Output is correct
14 Correct 18 ms 45404 KB Output is correct
15 Correct 19 ms 45652 KB Output is correct
16 Correct 19 ms 45768 KB Output is correct
17 Correct 19 ms 45660 KB Output is correct
18 Correct 17 ms 45656 KB Output is correct
19 Correct 17 ms 45656 KB Output is correct
20 Correct 18 ms 45660 KB Output is correct
21 Correct 19 ms 45660 KB Output is correct
22 Correct 22 ms 45660 KB Output is correct
23 Correct 18 ms 45400 KB Output is correct
24 Correct 19 ms 45656 KB Output is correct
25 Correct 21 ms 45688 KB Output is correct
26 Correct 19 ms 45660 KB Output is correct
27 Correct 19 ms 45632 KB Output is correct
28 Correct 19 ms 45400 KB Output is correct
29 Correct 22 ms 46168 KB Output is correct
30 Correct 20 ms 45656 KB Output is correct
31 Correct 21 ms 45776 KB Output is correct
32 Correct 21 ms 45660 KB Output is correct
33 Correct 19 ms 45660 KB Output is correct
34 Correct 20 ms 45520 KB Output is correct
35 Correct 24 ms 45660 KB Output is correct
36 Correct 18 ms 45660 KB Output is correct
37 Correct 19 ms 45660 KB Output is correct
38 Correct 1242 ms 144496 KB Output is correct
39 Execution timed out 5106 ms 856888 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 45404 KB Output is correct
2 Correct 20 ms 45400 KB Output is correct
3 Correct 20 ms 45412 KB Output is correct
4 Correct 23 ms 43868 KB Output is correct
5 Correct 38 ms 42588 KB Output is correct
6 Correct 20 ms 43096 KB Output is correct
7 Correct 21 ms 42844 KB Output is correct
8 Correct 21 ms 42588 KB Output is correct
9 Correct 21 ms 42800 KB Output is correct
10 Correct 32 ms 42780 KB Output is correct
11 Correct 22 ms 42588 KB Output is correct
12 Correct 34 ms 42840 KB Output is correct
13 Correct 37 ms 42844 KB Output is correct
14 Correct 57 ms 42784 KB Output is correct
15 Correct 40 ms 42844 KB Output is correct
16 Runtime error 205 ms 143856 KB Execution killed with signal 6
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 45404 KB Output is correct
2 Correct 19 ms 45404 KB Output is correct
3 Correct 18 ms 45404 KB Output is correct
4 Correct 22 ms 45660 KB Output is correct
5 Correct 30 ms 45660 KB Output is correct
6 Correct 20 ms 45656 KB Output is correct
7 Correct 19 ms 45660 KB Output is correct
8 Correct 22 ms 46168 KB Output is correct
9 Correct 1249 ms 144532 KB Output is correct
10 Execution timed out 5090 ms 837268 KB Time limit exceeded
11 Halted 0 ms 0 KB -