oj.uz

답안 #706544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
706544 2023-03-07T01:55:17 Z pcc Jail (JOI22_jail) C++14
21 / 100
 651 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxn =2e5+10;
int pre[mxn];
vector<int> tree[mxn];
vector<int> dir[mxn];
bitset<255> used;
int m;
int n;

void dfs(int now,int par){
    pre[now] = par;
    for(auto nxt:tree[now]){
        if(nxt == par)continue;
        dfs(nxt,now);
    }
    return;
}
bool f(int arr[]){
    bitset<255> tmp;
    for(int i = 1;i<=n;i++)tmp[i] = used[i];
    bool flag = true;
    // for(int i = 0;i<m;i++)cout<<arr[i]<<',';cout<<endl;
    for(int i = 0;i<m;i++){
        int now = arr[i];
        for(auto &j:dir[now])if(j != dir[now].back()&&tmp[j])flag = false;
        tmp[dir[now].back()] = false;
        tmp[dir[now][0]] = true;
        // for(int j = 1;j<=n;j++)cout<<tmp[j];cout<<endl;
    }
    if(flag)return true;
    else return false;
}
void solve1(){
    int m;
    cin>>m;
    pair<int,int> arr[m];
    for(auto &i:arr)cin>>i.first>>i.second;
    sort(arr,arr+m);
    int maxR = 0,minL = 0;
    bool flag = true;
    for(auto &i:arr){
        if(i.first>i.second){
            if(minL>i.second)flag = false;
            if(maxR>i.second)flag = false;
            minL = max(minL,i.second);
        }
        else{
            if(maxR>i.second)flag = false;
            maxR = max(maxR,i.second);
        }
    }
    if(flag)cout<<"Yes\n";
    else cout<<"No\n";
    return;
}
 

void solve(){
    cin>>n;
    for(int i = 0;i<n-1;i++){
        int a,b;
        cin>>a>>b;
        tree[a].push_back(b);
        tree[b].push_back(a);
    }
    cin>>m;
    if(m>6||n>250){
        solve1();
        return;
    }
    for(int i = 0;i<m;i++){
        int s,e;
        cin>>s>>e;
        used[s] = true;
        dfs(s,s);
        int tmp = e;
        dir[i].push_back(e);
        while(tmp != s){
            dir[i].push_back(tmp=pre[tmp]);
        }
        // for(int j = 1;j<=n;j++)cout<<pre[j]<<',';cout<<endl;
        // for(auto &j:dir[i])cout<<j<<',';cout<<endl;
    }
    int choice[m];
    for(int i = 0;i<m;i++)choice[i] = i;
    bool flag = false;
    if(f(choice))flag = true;
    while(next_permutation(choice,choice+m))if(f(choice))flag = true;
    if(flag)cout<<"Yes\n";
    else cout<<"No\n";
    for(int i = 0;i<=n;i++){
        tree[i].clear();
    }
    for(int i =0;i<m;i++)dir[i].clear();
    used.reset();
    return;
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--)solve();
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 13 ms 9724 KB Output is correct
5 Correct 25 ms 9724 KB Output is correct
6 Correct 5 ms 9740 KB Output is correct
7 Correct 25 ms 9732 KB Output is correct
8 Incorrect 5 ms 9684 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9720 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9668 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9720 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9668 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 26 ms 9732 KB Output is correct
17 Correct 11 ms 9732 KB Output is correct
18 Correct 21 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 21 ms 9684 KB Output is correct
21 Correct 17 ms 9684 KB Output is correct
22 Correct 21 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 7 ms 9724 KB Output is correct
25 Correct 26 ms 9720 KB Output is correct
26 Correct 10 ms 9640 KB Output is correct
27 Correct 18 ms 9728 KB Output is correct
28 Correct 8 ms 9720 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9720 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9668 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 26 ms 9732 KB Output is correct
17 Correct 11 ms 9732 KB Output is correct
18 Correct 21 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 21 ms 9684 KB Output is correct
21 Correct 17 ms 9684 KB Output is correct
22 Correct 21 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 7 ms 9724 KB Output is correct
25 Correct 26 ms 9720 KB Output is correct
26 Correct 10 ms 9640 KB Output is correct
27 Correct 18 ms 9728 KB Output is correct
28 Correct 8 ms 9720 KB Output is correct
29 Incorrect 6 ms 9684 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9684 KB Output is correct
6 Correct 6 ms 9720 KB Output is correct
7 Correct 7 ms 9684 KB Output is correct
8 Correct 6 ms 9668 KB Output is correct
9 Correct 6 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 26 ms 9732 KB Output is correct
17 Correct 11 ms 9732 KB Output is correct
18 Correct 21 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 21 ms 9684 KB Output is correct
21 Correct 17 ms 9684 KB Output is correct
22 Correct 21 ms 9732 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 7 ms 9724 KB Output is correct
25 Correct 26 ms 9720 KB Output is correct
26 Correct 10 ms 9640 KB Output is correct
27 Correct 18 ms 9728 KB Output is correct
28 Correct 8 ms 9720 KB Output is correct
29 Incorrect 6 ms 9684 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9652 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Runtime error 651 ms 1048576 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 13 ms 9724 KB Output is correct
5 Correct 25 ms 9724 KB Output is correct
6 Correct 5 ms 9740 KB Output is correct
7 Correct 25 ms 9732 KB Output is correct
8 Incorrect 5 ms 9684 KB Output isn't correct
9 Halted 0 ms 0 KB -