oj.uz

답안 #1001117

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001117 2024-06-18T14:55:15 Z De3b0o Jail (JOI22_jail) C++14
5 / 100
 5000 ms 74916 KB 
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)

using namespace std;

ll n , m;
vector<ll> adj[120009];
ll S[120009] , T[120009];
vector<ll> path[120009];
set<ll> pas[120009];
ll pr[120009];

void dfs(ll x , ll p , ll f , ll s)
{
    pr[x]=p;
    if(x==f)
    {
        ll y = f;
        while(y)
        {
            path[s].pb(y);
            pas[s].in(y);
            y=pr[y];
        }
        reverse(path[s].begin(),path[s].end());
        return;
    }
    for(auto it : adj[x])
    {
        if(it==p)
            continue;
        dfs(it,x,f,s);
    }
}

int main()
{
    d3
    ll t;
    cin >> t;
    while(t--)
    {
        cin >> n;
        for(int i = 1 ; n>=i ; i++)
            adj[i].clear();
        for(int i = 0 ; n-1>i ; i++)
        {
            ll u , v;
            cin >> u >> v;
            adj[u].pb(v);
            adj[v].pb(u);
        }
        cin >> m;
        for(int i = 1 ; m>=i ; i++)
        {
            cin >> S[i] >> T[i];
            path[i].clear();
            pas[i].clear();
            dfs(S[i],0,T[i],i);
        }
        bool ans = 1;
        for(int i = 1 ; m>=i ; i++)
        {
            for(int j = 1 ; m>=j ; j++)
            {
                if(i==j)
                    continue;
                if(pas[i].find(S[j])!=pas[i].end()&&pas[j].find(S[i])!=pas[j].end())
                    ans=0;
                if(pas[i].find(T[j])!=pas[i].end()&&pas[j].find(T[i])!=pas[j].end())
                    ans=0;
                bool l = 1;
                for(auto it : path[i])
                {
                    if(pas[j].find(it)==pas[j].end())
                        l=0;
                }
                if(l)
                    ans=0;
            }
        }
        if(ans)
            yes
        else
            no
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14172 KB Output is correct
2 Correct 2 ms 14368 KB Output is correct
3 Correct 2 ms 14172 KB Output is correct
4 Correct 10 ms 14400 KB Output is correct
5 Correct 20 ms 14900 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 4 ms 14428 KB Output is correct
8 Correct 81 ms 15128 KB Output is correct
9 Execution timed out 5058 ms 74916 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14172 KB Output is correct
2 Correct 3 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14212 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 3 ms 14384 KB Output is correct
7 Correct 4 ms 14436 KB Output is correct
8 Correct 4 ms 14384 KB Output is correct
9 Correct 6 ms 14428 KB Output is correct
10 Correct 3 ms 14428 KB Output is correct
11 Correct 3 ms 14340 KB Output is correct
12 Correct 4 ms 14172 KB Output is correct
13 Correct 3 ms 14172 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14172 KB Output is correct
2 Correct 3 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14212 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 3 ms 14384 KB Output is correct
7 Correct 4 ms 14436 KB Output is correct
8 Correct 4 ms 14384 KB Output is correct
9 Correct 6 ms 14428 KB Output is correct
10 Correct 3 ms 14428 KB Output is correct
11 Correct 3 ms 14340 KB Output is correct
12 Correct 4 ms 14172 KB Output is correct
13 Correct 3 ms 14172 KB Output is correct
14 Incorrect 3 ms 14172 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14172 KB Output is correct
2 Correct 3 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14212 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 3 ms 14384 KB Output is correct
7 Correct 4 ms 14436 KB Output is correct
8 Correct 4 ms 14384 KB Output is correct
9 Correct 6 ms 14428 KB Output is correct
10 Correct 3 ms 14428 KB Output is correct
11 Correct 3 ms 14340 KB Output is correct
12 Correct 4 ms 14172 KB Output is correct
13 Correct 3 ms 14172 KB Output is correct
14 Incorrect 3 ms 14172 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14172 KB Output is correct
2 Correct 3 ms 14424 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 4 ms 14212 KB Output is correct
5 Correct 5 ms 14424 KB Output is correct
6 Correct 3 ms 14384 KB Output is correct
7 Correct 4 ms 14436 KB Output is correct
8 Correct 4 ms 14384 KB Output is correct
9 Correct 6 ms 14428 KB Output is correct
10 Correct 3 ms 14428 KB Output is correct
11 Correct 3 ms 14340 KB Output is correct
12 Correct 4 ms 14172 KB Output is correct
13 Correct 3 ms 14172 KB Output is correct
14 Incorrect 3 ms 14172 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14172 KB Output is correct
2 Incorrect 4 ms 14172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14172 KB Output is correct
2 Correct 2 ms 14368 KB Output is correct
3 Correct 2 ms 14172 KB Output is correct
4 Correct 10 ms 14400 KB Output is correct
5 Correct 20 ms 14900 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 4 ms 14428 KB Output is correct
8 Correct 81 ms 15128 KB Output is correct
9 Execution timed out 5058 ms 74916 KB Time limit exceeded
10 Halted 0 ms 0 KB -