QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#808645	#8551. DFS Order 5	ucup-team2179	WA	44ms	3840kb	C++20	3.3kb	2024-12-10 23:00:31	2024-12-10 23:00:31

Judging History

你现在查看的是最新测评结果

[2024-12-10 23:00:31]
评测

测评结果：WA
用时：44ms
内存：3840kb

查看

[2024-12-10 23:00:31]
提交

answer

#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int, int>
using namespace std;
struct ollca{
    vector<vector<int> > adj;
    vector<int>L;
    vector<int>dfn;
    vector<int>siz;
    vector<int>fa;
    int cnt=0,n;
    vector<vector<int> >mylist;
    void dfs(int u,int f){
        cnt++;
        dfn[cnt]=u;
        L[u]=cnt;
        siz[u]++;
        for(auto p:adj[u]){
            if(p==f)continue;
            fa[p]=u;
            dfs(p,u);
            cnt++;
            dfn[cnt]=u;
            siz[u]+=siz[p];
        }
    }
    int op(int l,int r){
        if(L[l]<L[r])return l;
        return r;
    };
    ollca(){}
    ollca(vector<vector<int> > a,int root){
        adj=a;
        n=a.size()-1;
        L.resize(n+1);
        fa.resize(n+1);
        siz.resize(n+1);
        dfn.resize(n*2);
        dfs(root,0);
        mylist=vector<vector<int>>(2*n+1,vector<int>(__lg(2*n-1)+1));
        for(int i=1;i<=2*n-1;i++)
        mylist[i][0]=dfn[i];
        for(int j=1;j<=__lg(2*n-1);j++)
        for(int i=1;i<=2*n-1-(1<<j)+1;i++)
            mylist[i][j]=op(mylist[i][j-1],mylist[i+(1<<j-1)][j-1]);
    }
    int lca(int l,int r){
        l=L[l];
        r=L[r];
        if(l>r)swap(l,r);
        int len=__lg(r-l+1);
        return op(mylist[l][len],mylist[r-(1<<len)+1][len]);
    }
}tr;
int LCA(int u, int v) {
    return tr.lca(u, v);
}
struct stable {
    vector<vector<int>> mylist;
    int n;
    int (*op) (int a, int b);
    stable(vector<int>&a, int(*f)(int, int)) {
        op = f;
        n = a.size() - 1;
        mylist = vector<vector<int>> (n + 1, vector<int>(__lg(n) + 1));
        for (int i = 1; i <= n; i++) mylist[i][0] = a[i];
        for (int j = 1; j <= __lg(n); j++)
            for (int i = 1; i <= n - (1 << j) + 1; i++)
                mylist[i][j] = op(mylist[i][j - 1], mylist[i + (1 << j - 1)][j - 1]);
    }
    int q(int l, int r) {
        assert(l >= 1 && r <= n && l <= r);
        int len = __lg(r - l + 1);
        return op(mylist[l][len], mylist[r - (1 << len) + 1][len]);
    }
};
void solve() {
    int n, q; cin >> n >> q;
    vector<vector<int> > a(n+1);
    for (int i = 1; i < n; i++) {
        int u, v; cin >> u >> v;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    tr=ollca(a,1);
    while (q--) {
        int k; cin >> k;
        set<int> s;
        vector<int> arr(k + 1);
        for (int i = 1; i <= k; i++) cin >> arr[i], s.insert(arr[i]);
        if (s.size() != k) {
            cout << "No\n";
            continue;
        }
        s.clear();
        stable st(arr, LCA);
        int flag = 1;
        for (int i = 1; i < k && flag; i++)
            flag &= (LCA(arr[i], arr[i + 1]) == tr.fa[arr[i + 1]]);
        for (int i = 1; i <= k && flag; i++) {
            flag &= (arr[i] == st.q(i, min(k, i + tr.siz[arr[i]] - 1)));
        }
        for (int i = 1; i <= k && flag; i++) {
            if(s.lower_bound(tr.L[arr[i]])!=s.end()&&*s.lower_bound(tr.L[arr[i]])<=tr.L[arr[i]]+tr.siz[arr[i]]-1)flag=0;
            s.insert(tr.L[arr[i]]);
        }
        if (flag) cout << "Yes\n";
        else cout << "No\n";
    }
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3600kb

input:

6 7
1 2
1 3
2 4
3 5
2 6
2 4 1
2 4 2
2 4 3
2 4 4
2 4 5
2 4 6
6 1 2 6 4 3 5

output:

No
No
Yes
No
No
Yes
Yes

result:

ok 7 tokens

Test #2:

score: -100

Wrong Answer

time: 44ms

memory: 3840kb

input:

10 100000
7 2
1 7
7 10
8 6
8 7
1 3
4 5
9 5
5 8
8 8 9 7 2 8 1 6 1
4 8 3 5 2
6 7 10 3 9 9 1
1 1
8 10 3 2 9 3 8 7 3
7 5 6 2 8 5 9 1
6 3 4 6 2 1 3
5 8 9 2 4 9
1 3
2 1 5
5 8 5 1 7 9
10 5 2 9 2 6 4 10 6 3 8
3 4 5 8
2 8 4
9 4 10 1 2 4 3 3 6 3
1 3
6 1 1 6 8 3 1
3 7 3 2
3 9 1 5
4 3 7 8 10
9 4 2 3 10 2 5 4 3 ...

output:

No
No
No
Yes
No
No
No
No
Yes
No
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
No
No
No
No
No
Yes
No
No
No
No
No
Yes
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
No
Yes
Yes
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
N...

result:

wrong answer 3780th words differ - expected: 'No', found: 'Yes'