oj.uz

답안 #1077445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077445 2024-08-27T07:18:20 Z modwwe Jail (JOI22_jail) C++17
60 / 100
 5000 ms 797488 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;

main()
{
#ifndef ONLINE_JUDGE
   //fin(task),fou(task);
#endif
    NHP
    /// cin>>s1;
    modwwe
    phongbeo(),down
//checktime
}
int st[17][120001];
int depth[120001];
int head[120001];
int pos[120001];
vector<int> v2[120001];
vector<ib> v[480001][2];
int heavy[120001];
ib a[120001];
int f[120001];
int b[480001];
int sz[120001];
int mxz[120001];
int c[480001][2];
void dfs(int x,int y)
{
    sz[x]=1;
    mxz[x]=0;
    st[0][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];
        }
    }
}

int lca2(int x,int y)
{
    if(depth[x]<depth[y]) swap(x,y);
    int ss=depth[x]-depth[y]-1;
    if(ss>=0)
        for(int j=0; j<17; ++j)
            if(bit(ss,j))
                x=st[j][x];
    if(st[0][x]==y) return x;
    if(ss!=-1)  x=st[0][x];
    for(int j=16; j>=0; --j)
        if(st[j][x]!=st[j][y])
            x=st[j][x],y=st[j][y];
    return x;
}
int lca(int x,int y)
{
    if(depth[x]<depth[y]) swap(x,y);
    int ss=depth[x]-depth[y];
    for(int j=0; j<17; ++j)
        if(bit(ss,j))
            x=st[j][x];
    if(x==y) return x;
    for(int j=16; j>=0; --j)
        if(st[j][x]!=st[j][y])
            x=st[j][x],y=st[j][y];
    return st[0][x];
}
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);
}
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>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            v[x][0].pb({node,0});
         //   if(x==5) cout<<node,debug
            return;
        }
        int mid=l+r>>1;
        upd(node<<1,l,mid,l1,r1,x);
        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>r1||r<l1) return;
        if(l>=l1&&r<=r1)
        {
            v[node][1].pb({x,0});
            ///if(node==5) cout<<x<<" "<<l1<<" "<<r1<<" fadfdafafa",debug
            return;
        }
        int mid=l+r>>1;
        upd2(node<<1,l,mid,l1,r1,x);
        upd2(node<<1|1,mid+1,r,l1,r1,x);
 }
    void hld(int x,int y,int z)
    {
        if(pos[x]<pos[y]) return;
        if(pos[head[x]]<=pos[y]) upd(1,1,n,pos[y],pos[x],z);
        else upd(1,1,n,pos[head[x]],pos[x],z),hld(st[0][head[x]],y,z);
    }
    void hld2(int x,int y,int z)
    {
        if(pos[x]<pos[y]) return;
        if(pos[head[x]]<=pos[y]) upd2(1,1,n,pos[y],pos[x],z);
        else upd2(1,1,n,pos[head[x]],pos[x],z),hld2(st[0][head[x]],y,z);
    }
    void upd_hld(int x,int y)
    {
        s2=lca(x,y);
        s3=lca2(s2,y);
        hld(st[0][x],s2,f[pos[x]]);
        hld(y,s3,f[pos[x]]);
if(s2==y)s2=lca2(x,s2);
         hld2(x,s2,f[pos[x]]);
        hld2(st[0][y],s3,f[pos[x]]);
    }
} stt;
bool de;
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()
{
    cin>>n;
    /// cach 1
    de=0;
    dem=0;
    for(int i=1; i<=n; i++)
        v2[i].clear(),b[i]=0,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++)
        cin>>l>>r,v2[l].pb(r),v2[r].pb(l);
    dfs(1,0);
    des(1,0);
    for(int i=1; i<17; i++)
        for(int j=1; j<=n; j++)
            st[i][j]=st[i-1][st[i-1][j]];
    stt.setup(1,1,n);
    cin>>m;
    for(int i=1; i<=m; i++)
        cin>>a[i].a>>a[i].b,stt.upd_hld(a[i].a,a[i].b),v[f[pos[a[i].a]]][0].pb({f[pos[a[i].b]],1});
 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:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main()
      | ^~~~
jail.cpp: In member function 'void IT::setup(int, int, int)':
jail.cpp:142:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  142 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd(int, int, int, int, int, int)':
jail.cpp:155:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  155 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd2(int, int, int, int, int, int)':
jail.cpp:169:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  169 |         int mid=l+r>>1;
      |                 ~^~
jail.cpp: In member function 'void IT::upd_hld(int, int)':
jail.cpp:191:1: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  191 | if(s2==y)s2=lca2(x,s2);
      | ^~
jail.cpp:192:10: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  192 |          hld2(x,s2,f[pos[x]]);
      |          ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25944 KB Output is correct
2 Correct 15 ms 25820 KB Output is correct
3 Correct 14 ms 25944 KB Output is correct
4 Correct 25 ms 26460 KB Output is correct
5 Correct 36 ms 26712 KB Output is correct
6 Correct 15 ms 25948 KB Output is correct
7 Correct 17 ms 25948 KB Output is correct
8 Correct 20 ms 26700 KB Output is correct
9 Correct 1389 ms 126292 KB Output is correct
10 Execution timed out 5110 ms 797488 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25812 KB Output is correct
2 Correct 15 ms 25944 KB Output is correct
3 Correct 16 ms 25948 KB Output is correct
4 Correct 16 ms 25948 KB Output is correct
5 Correct 14 ms 25844 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 15 ms 25948 KB Output is correct
8 Correct 15 ms 25948 KB Output is correct
9 Correct 13 ms 25948 KB Output is correct
10 Correct 22 ms 25944 KB Output is correct
11 Correct 15 ms 25948 KB Output is correct
12 Correct 15 ms 25844 KB Output is correct
13 Correct 19 ms 25948 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25812 KB Output is correct
2 Correct 15 ms 25944 KB Output is correct
3 Correct 16 ms 25948 KB Output is correct
4 Correct 16 ms 25948 KB Output is correct
5 Correct 14 ms 25844 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 15 ms 25948 KB Output is correct
8 Correct 15 ms 25948 KB Output is correct
9 Correct 13 ms 25948 KB Output is correct
10 Correct 22 ms 25944 KB Output is correct
11 Correct 15 ms 25948 KB Output is correct
12 Correct 15 ms 25844 KB Output is correct
13 Correct 19 ms 25948 KB Output is correct
14 Correct 15 ms 25948 KB Output is correct
15 Correct 14 ms 25956 KB Output is correct
16 Correct 14 ms 25948 KB Output is correct
17 Correct 16 ms 25948 KB Output is correct
18 Correct 16 ms 25944 KB Output is correct
19 Correct 15 ms 25964 KB Output is correct
20 Correct 17 ms 26076 KB Output is correct
21 Correct 15 ms 25948 KB Output is correct
22 Correct 15 ms 25948 KB Output is correct
23 Correct 15 ms 25944 KB Output is correct
24 Correct 15 ms 25952 KB Output is correct
25 Correct 17 ms 26072 KB Output is correct
26 Correct 13 ms 25880 KB Output is correct
27 Correct 16 ms 25948 KB Output is correct
28 Correct 13 ms 25948 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25812 KB Output is correct
2 Correct 15 ms 25944 KB Output is correct
3 Correct 16 ms 25948 KB Output is correct
4 Correct 16 ms 25948 KB Output is correct
5 Correct 14 ms 25844 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 15 ms 25948 KB Output is correct
8 Correct 15 ms 25948 KB Output is correct
9 Correct 13 ms 25948 KB Output is correct
10 Correct 22 ms 25944 KB Output is correct
11 Correct 15 ms 25948 KB Output is correct
12 Correct 15 ms 25844 KB Output is correct
13 Correct 19 ms 25948 KB Output is correct
14 Correct 15 ms 25948 KB Output is correct
15 Correct 14 ms 25956 KB Output is correct
16 Correct 14 ms 25948 KB Output is correct
17 Correct 16 ms 25948 KB Output is correct
18 Correct 16 ms 25944 KB Output is correct
19 Correct 15 ms 25964 KB Output is correct
20 Correct 17 ms 26076 KB Output is correct
21 Correct 15 ms 25948 KB Output is correct
22 Correct 15 ms 25948 KB Output is correct
23 Correct 15 ms 25944 KB Output is correct
24 Correct 15 ms 25952 KB Output is correct
25 Correct 17 ms 26072 KB Output is correct
26 Correct 13 ms 25880 KB Output is correct
27 Correct 16 ms 25948 KB Output is correct
28 Correct 13 ms 25948 KB Output is correct
29 Correct 20 ms 26524 KB Output is correct
30 Correct 16 ms 26136 KB Output is correct
31 Correct 19 ms 26204 KB Output is correct
32 Correct 19 ms 26204 KB Output is correct
33 Correct 16 ms 26016 KB Output is correct
34 Correct 19 ms 25952 KB Output is correct
35 Correct 22 ms 26088 KB Output is correct
36 Correct 16 ms 25968 KB Output is correct
37 Correct 17 ms 25904 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 25812 KB Output is correct
2 Correct 15 ms 25944 KB Output is correct
3 Correct 16 ms 25948 KB Output is correct
4 Correct 16 ms 25948 KB Output is correct
5 Correct 14 ms 25844 KB Output is correct
6 Correct 15 ms 26200 KB Output is correct
7 Correct 15 ms 25948 KB Output is correct
8 Correct 15 ms 25948 KB Output is correct
9 Correct 13 ms 25948 KB Output is correct
10 Correct 22 ms 25944 KB Output is correct
11 Correct 15 ms 25948 KB Output is correct
12 Correct 15 ms 25844 KB Output is correct
13 Correct 19 ms 25948 KB Output is correct
14 Correct 15 ms 25948 KB Output is correct
15 Correct 14 ms 25956 KB Output is correct
16 Correct 14 ms 25948 KB Output is correct
17 Correct 16 ms 25948 KB Output is correct
18 Correct 16 ms 25944 KB Output is correct
19 Correct 15 ms 25964 KB Output is correct
20 Correct 17 ms 26076 KB Output is correct
21 Correct 15 ms 25948 KB Output is correct
22 Correct 15 ms 25948 KB Output is correct
23 Correct 15 ms 25944 KB Output is correct
24 Correct 15 ms 25952 KB Output is correct
25 Correct 17 ms 26072 KB Output is correct
26 Correct 13 ms 25880 KB Output is correct
27 Correct 16 ms 25948 KB Output is correct
28 Correct 13 ms 25948 KB Output is correct
29 Correct 20 ms 26524 KB Output is correct
30 Correct 16 ms 26136 KB Output is correct
31 Correct 19 ms 26204 KB Output is correct
32 Correct 19 ms 26204 KB Output is correct
33 Correct 16 ms 26016 KB Output is correct
34 Correct 19 ms 25952 KB Output is correct
35 Correct 22 ms 26088 KB Output is correct
36 Correct 16 ms 25968 KB Output is correct
37 Correct 17 ms 25904 KB Output is correct
38 Correct 1518 ms 126400 KB Output is correct
39 Execution timed out 5100 ms 515128 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 25944 KB Output is correct
2 Correct 14 ms 25948 KB Output is correct
3 Correct 14 ms 25744 KB Output is correct
4 Correct 15 ms 25944 KB Output is correct
5 Correct 19 ms 25948 KB Output is correct
6 Correct 14 ms 25944 KB Output is correct
7 Correct 15 ms 25944 KB Output is correct
8 Correct 14 ms 25948 KB Output is correct
9 Correct 12 ms 25948 KB Output is correct
10 Correct 12 ms 25908 KB Output is correct
11 Correct 12 ms 25932 KB Output is correct
12 Correct 13 ms 25948 KB Output is correct
13 Correct 45 ms 26460 KB Output is correct
14 Correct 58 ms 26792 KB Output is correct
15 Correct 46 ms 26672 KB Output is correct
16 Correct 123 ms 61800 KB Output is correct
17 Correct 382 ms 80312 KB Output is correct
18 Correct 638 ms 105932 KB Output is correct
19 Correct 213 ms 66316 KB Output is correct
20 Correct 176 ms 66384 KB Output is correct
21 Correct 198 ms 66640 KB Output is correct
22 Correct 341 ms 82492 KB Output is correct
23 Correct 245 ms 81936 KB Output is correct
24 Correct 269 ms 83780 KB Output is correct
25 Correct 241 ms 84164 KB Output is correct
26 Correct 281 ms 84220 KB Output is correct
27 Correct 254 ms 70080 KB Output is correct
28 Correct 213 ms 71108 KB Output is correct
29 Correct 209 ms 69060 KB Output is correct
30 Correct 203 ms 65816 KB Output is correct
31 Correct 196 ms 66568 KB Output is correct
32 Correct 202 ms 66820 KB Output is correct
33 Correct 245 ms 67364 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 25944 KB Output is correct
2 Correct 15 ms 25820 KB Output is correct
3 Correct 14 ms 25944 KB Output is correct
4 Correct 25 ms 26460 KB Output is correct
5 Correct 36 ms 26712 KB Output is correct
6 Correct 15 ms 25948 KB Output is correct
7 Correct 17 ms 25948 KB Output is correct
8 Correct 20 ms 26700 KB Output is correct
9 Correct 1389 ms 126292 KB Output is correct
10 Execution timed out 5110 ms 797488 KB Time limit exceeded
11 Halted 0 ms 0 KB -