oj.uz

답안 #994294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994294 2024-06-07T10:26:42 Z UVince Jail (JOI22_jail) C++17
21 / 100
 788 ms 9220 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

#define int ll
void solve();

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);

    int t=1;
    cin>>t;
    while (t--) solve();
    return 0;
}

const int maxn = 120'000;


vector<vector<int>> g(maxn);
vector<int> num(maxn);
int n,m;
vector<int> s(maxn),t(maxn);
vector<vector<int>> path(maxn);
vector<bool> has(maxn,false);

bool dfs (int v, int start, int par=-1){
    if (v==t[start]) return true;
    for (int to : g[v]){
        if (to==par) continue;
        if (dfs(to, start, v)){
            num[to]++;
            path[start].push_back(to);
            return true;
        }
    }
    return false;
}

void dolanc(){
    cin>>m;
    vector<int> lst(maxn,0);
    vector<int> rst(maxn,0);
    vector<pair<int,int>> srt;
    bool ans=true;
    for (int i = 1; i <= m; i++)
    {
        cin>>s[i]>>t[i];
        if (s[i]<t[i]) lst[t[i]]=i;
        else rst[t[i]]=i;
        if (s[i]<t[i]) srt.push_back({s[i], 0-t[i]});
        else srt.push_back({t[i], 0-s[i]});
    }
    sort(srt.begin(), srt.end());
    int mx=0;
    for (int i=1;i<=n;i++){
        if (lst[i]){
            if (mx>=i) ans=false;
        }
        else if (rst[i]){
            mx=max(mx, s[rst[i]]);
        }
    }

    stack<pair<int,int>> st;

    for (auto x: srt){
        int i=x.first;
        int j=0-x.second;
        while (!st.empty() && st.top().second<j) st.pop();
        if (!st.empty()) ans=false;
        st.push(make_pair(i,j));
    }

    if (ans){
        cout<<"Yes\n";
    }
    else {
        cout<<"No\n";
    }
}

void solve(){
    cin>>n;
    path.assign(maxn, {});
    num.assign(maxn,0);
    has.assign(maxn,false);
    g.assign(maxn,{});
    queue<int> q;
    bool lanc=true;
    for (int i = 1; i < n; i++)
    {
        int a,b;
        cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
        if (a!=i || b!=i+1) lanc=false;
    }
    cin>>m;
    for (int i = 1; i <= m; i++)
    {
        cin>>s[i]>>t[i];
        dfs(s[i], i);
        //num[s[i]]++;
        q.push(i);
        has[s[i]]=true;
    }
    bool change=true;
    while (change){
        change=false;
        int sz=q.size();
        for (int i=0;i<sz;i++){
            int cur=q.front();
            q.pop();
            bool rem=num[t[cur]]>1;

            for (int j : path[cur]){
                if (has[j]) rem=true;
            }
            if (rem) {
                q.push(cur);
                continue;
            }
            change=true;
            has[s[cur]]=false;
            num[s[cur]]--;
            for (int j : path[cur]){
                num[j]--;
            }
        }
    }
    if (q.empty()){
        cout<<"Yes\n";
    }
    else {
        cout<<"No\n";
    }
}

Compilation message

jail.cpp: In function 'void solve()':
jail.cpp:90:10: warning: variable 'lanc' set but not used [-Wunused-but-set-variable]
   90 |     bool lanc=true;
      |          ^~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8796 KB Output is correct
2 Correct 7 ms 8948 KB Output is correct
3 Correct 4 ms 9048 KB Output is correct
4 Incorrect 348 ms 9220 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 33 ms 8980 KB Output is correct
4 Correct 19 ms 8796 KB Output is correct
5 Correct 19 ms 8796 KB Output is correct
6 Correct 33 ms 8796 KB Output is correct
7 Correct 19 ms 8792 KB Output is correct
8 Correct 21 ms 8796 KB Output is correct
9 Correct 19 ms 9048 KB Output is correct
10 Correct 17 ms 8796 KB Output is correct
11 Correct 17 ms 8796 KB Output is correct
12 Correct 20 ms 8796 KB Output is correct
13 Correct 19 ms 8952 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 33 ms 8980 KB Output is correct
4 Correct 19 ms 8796 KB Output is correct
5 Correct 19 ms 8796 KB Output is correct
6 Correct 33 ms 8796 KB Output is correct
7 Correct 19 ms 8792 KB Output is correct
8 Correct 21 ms 8796 KB Output is correct
9 Correct 19 ms 9048 KB Output is correct
10 Correct 17 ms 8796 KB Output is correct
11 Correct 17 ms 8796 KB Output is correct
12 Correct 20 ms 8796 KB Output is correct
13 Correct 19 ms 8952 KB Output is correct
14 Correct 9 ms 8796 KB Output is correct
15 Correct 5 ms 8952 KB Output is correct
16 Correct 19 ms 8796 KB Output is correct
17 Correct 19 ms 8792 KB Output is correct
18 Correct 18 ms 8976 KB Output is correct
19 Correct 18 ms 8928 KB Output is correct
20 Correct 19 ms 8796 KB Output is correct
21 Correct 19 ms 8980 KB Output is correct
22 Correct 19 ms 8980 KB Output is correct
23 Correct 20 ms 8796 KB Output is correct
24 Correct 18 ms 8796 KB Output is correct
25 Correct 19 ms 8796 KB Output is correct
26 Correct 18 ms 8796 KB Output is correct
27 Correct 23 ms 8792 KB Output is correct
28 Correct 20 ms 8796 KB Output is correct

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 33 ms 8980 KB Output is correct
4 Correct 19 ms 8796 KB Output is correct
5 Correct 19 ms 8796 KB Output is correct
6 Correct 33 ms 8796 KB Output is correct
7 Correct 19 ms 8792 KB Output is correct
8 Correct 21 ms 8796 KB Output is correct
9 Correct 19 ms 9048 KB Output is correct
10 Correct 17 ms 8796 KB Output is correct
11 Correct 17 ms 8796 KB Output is correct
12 Correct 20 ms 8796 KB Output is correct
13 Correct 19 ms 8952 KB Output is correct
14 Correct 9 ms 8796 KB Output is correct
15 Correct 5 ms 8952 KB Output is correct
16 Correct 19 ms 8796 KB Output is correct
17 Correct 19 ms 8792 KB Output is correct
18 Correct 18 ms 8976 KB Output is correct
19 Correct 18 ms 8928 KB Output is correct
20 Correct 19 ms 8796 KB Output is correct
21 Correct 19 ms 8980 KB Output is correct
22 Correct 19 ms 8980 KB Output is correct
23 Correct 20 ms 8796 KB Output is correct
24 Correct 18 ms 8796 KB Output is correct
25 Correct 19 ms 8796 KB Output is correct
26 Correct 18 ms 8796 KB Output is correct
27 Correct 23 ms 8792 KB Output is correct
28 Correct 20 ms 8796 KB Output is correct
29 Correct 38 ms 9044 KB Output is correct
30 Correct 33 ms 8796 KB Output is correct
31 Correct 34 ms 9052 KB Output is correct
32 Correct 19 ms 8796 KB Output is correct
33 Incorrect 32 ms 8796 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 33 ms 8980 KB Output is correct
4 Correct 19 ms 8796 KB Output is correct
5 Correct 19 ms 8796 KB Output is correct
6 Correct 33 ms 8796 KB Output is correct
7 Correct 19 ms 8792 KB Output is correct
8 Correct 21 ms 8796 KB Output is correct
9 Correct 19 ms 9048 KB Output is correct
10 Correct 17 ms 8796 KB Output is correct
11 Correct 17 ms 8796 KB Output is correct
12 Correct 20 ms 8796 KB Output is correct
13 Correct 19 ms 8952 KB Output is correct
14 Correct 9 ms 8796 KB Output is correct
15 Correct 5 ms 8952 KB Output is correct
16 Correct 19 ms 8796 KB Output is correct
17 Correct 19 ms 8792 KB Output is correct
18 Correct 18 ms 8976 KB Output is correct
19 Correct 18 ms 8928 KB Output is correct
20 Correct 19 ms 8796 KB Output is correct
21 Correct 19 ms 8980 KB Output is correct
22 Correct 19 ms 8980 KB Output is correct
23 Correct 20 ms 8796 KB Output is correct
24 Correct 18 ms 8796 KB Output is correct
25 Correct 19 ms 8796 KB Output is correct
26 Correct 18 ms 8796 KB Output is correct
27 Correct 23 ms 8792 KB Output is correct
28 Correct 20 ms 8796 KB Output is correct
29 Correct 38 ms 9044 KB Output is correct
30 Correct 33 ms 8796 KB Output is correct
31 Correct 34 ms 9052 KB Output is correct
32 Correct 19 ms 8796 KB Output is correct
33 Incorrect 32 ms 8796 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8792 KB Output is correct
2 Correct 4 ms 8796 KB Output is correct
3 Correct 5 ms 8796 KB Output is correct
4 Correct 4 ms 8796 KB Output is correct
5 Correct 788 ms 8936 KB Output is correct
6 Correct 23 ms 8796 KB Output is correct
7 Correct 19 ms 8956 KB Output is correct
8 Correct 32 ms 8796 KB Output is correct
9 Correct 18 ms 8796 KB Output is correct
10 Correct 18 ms 8796 KB Output is correct
11 Correct 17 ms 8796 KB Output is correct
12 Correct 20 ms 8796 KB Output is correct
13 Incorrect 784 ms 8940 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8796 KB Output is correct
2 Correct 7 ms 8948 KB Output is correct
3 Correct 4 ms 9048 KB Output is correct
4 Incorrect 348 ms 9220 KB Output isn't correct
5 Halted 0 ms 0 KB -