oj.uz

답안 #719210

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719210 2023-04-05T16:20:45 Z bin9638 Simurgh (IOI17_simurgh) C++17
70 / 100
 759 ms 5368 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "simurgh.h"
#endif // SKY

using namespace std;

#define N  510
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

int tmp[N],n,m,times,ktr[N*N],par_id[N];
ii cnt[N],canh[N*N];
vector<ii>g[N];
vector<int>lis;

struct DSU
{
    int lab[N];

    void init()
    {
        memset(lab,-1,sizeof(lab));
    }

    int root(int u)
    {
        if(lab[u]<0)
            return u;
        return(lab[u]=root(lab[u]));
    }

    bool update(int u,int v)
    {
        if((u=root(u))==(v=root(v)))
            return 0;
        if(lab[u]>lab[v])
            swap(u,v);
        lab[u]+=lab[v];
        lab[v]=u;
        return 1;
    }
}T;

#ifdef SKY
int chon[N*N];
int count_common_roads(vector<int>r)
{
    int res=0;
    for(auto i:r)
        res+=chon[i];
    return res;
}
#endif // SKY

int query=0;

int my_ask(vector<int>r)
{
    assert(r.size()==n-1);
    query++;
    return count_common_roads(r);
}

void DFS(int u,int p)
{
    cnt[u].fs=++times;
    for(auto v:g[u])
        if(v.fs!=p)
        {
            par_id[v.fs]=v.sc;
            DFS(v.fs,u);
        }
    cnt[u].sc=times;
}

bool tren(int u,int v)
{
    return (cnt[u].fs<=cnt[v].fs&&cnt[u].sc>=cnt[v].sc);
}

ii get_cnt(int u,int v)
{
    ii res={0,0};
    for(int i=0;i<n;i++)
        if(tren(i,u)+tren(i,v)==1)
        {
            if(ktr[par_id[i]]==-1)
                res.fs++;
                    else res.sc++;
        }
    return res;
}

void solve(vector<int>s)
{
    if(s.empty())
        return;
    vector<int>hoi;
    T.init();
    for(auto u:s)
        T.update(canh[u].fs,canh[u].sc),hoi.pb(u);
    int val=0;
    for(auto i:lis)
        if(T.update(canh[i].fs,canh[i].sc))
            val+=ktr[i],hoi.pb(i);
    if(val==my_ask(hoi))
    {
        for(auto u:s)
            ktr[u]=0;
        return;
    }
    if(s.size()==1)
    {
        ktr[s[0]]=1;
        return;
    }
    vector<int>L,R;
    for(int i=0;i<s.size();i++)
        if(i*2<s.size())
            L.pb(s[i]);
                else R.pb(s[i]);
    solve(L);
    solve(R);
}

vector<int> find_roads(int cc, vector<int> canh_fs, vector<int> canh_sc)
{
    n=cc;
    m=canh_fs.size();
    for(int i=0;i<m;i++)
        canh[i]={canh_fs[i],canh_sc[i]};
    memset(ktr,-1,sizeof(ktr));
    T.init();
    for(int i=0;i<m;i++)
        if(T.update(canh[i].fs,canh[i].sc))
        {
            lis.pb(i);
           // cout<<i<<endl;
            g[canh[i].fs].pb({canh[i].sc,i});
            g[canh[i].sc].pb({canh[i].fs,i});
        }
    memset(par_id,-1,sizeof(par_id));
    DFS(0,-1);
    int val=my_ask(lis);
    //cout<<val<<endl;
   for(int i=0;i<m;i++)
   {
       ii cc=get_cnt(canh[i].fs,canh[i].sc);
       if(cc.fs>0&&cc.fs+cc.sc>1)
       {
            int u=canh[i].fs,v=canh[i].sc;
            if(cc.sc==0)
            {
                int kt=0;
                for(int j=0;j<n;j++)
                    if(tren(j,u)+tren(j,v)==1)
                    {
                        vector<int>luu=lis;
                        for(int t=0;t<n-1;t++)
                            if(luu[t]==par_id[j])
                                luu[t]=i;
                        tmp[j]=my_ask(luu);
                        if(tmp[j]>val)
                            kt=1;
                    }
                for(int j=0;j<n;j++)
                    if(tren(j,u)+tren(j,v)==1)
                    {
                       if(kt==0)
                       {
                           ktr[par_id[j]]=(tmp[j]<val);
                       }else
                       {
                            ktr[par_id[j]]=(tmp[j]==val);
                       }
                    }
            }else
            {
                int kt=0;
                for(int j=0;j<n;j++)
                    if(tren(j,u)+tren(j,v)==1&&ktr[par_id[j]]!=-1)
                    {
                        vector<int>luu=lis;
                        for(int t=0;t<n-1;t++)
                            if(luu[t]==par_id[j])
                                luu[t]=i;
                        if(ktr[par_id[j]]==0)
                        {
                            kt=(my_ask(luu)>val);
                        }else
                        {
                            kt=(my_ask(luu)==val);
                        }
                        break;
                    }
                 for(int j=0;j<n;j++)
                    if(tren(j,u)+tren(j,v)==1&&ktr[par_id[j]]==-1)
                    {
                        vector<int>luu=lis;
                        for(int t=0;t<n-1;t++)
                            if(luu[t]==par_id[j])
                                luu[t]=i;
                        tmp[j]=my_ask(luu);
                       if(kt==0)
                       {
                           ktr[par_id[j]]=(tmp[j]<val);
                       }else
                       {
                            ktr[par_id[j]]=(tmp[j]==val);
                       }
                    }
            }
       }
   }
    for(auto i:lis)
        if(ktr[i]==-1)
            ktr[i]=1;
    while(1)
    {
        int kt=0;
        for(int i=0;i<m;i++)
            if(ktr[i]==-1)
                kt=1;
        if(kt==0)
            break;
        T.init();
        vector<int>s;
        for(int i=0;i<m;i++)
            if(ktr[i]==-1&&T.update(canh[i].fs,canh[i].sc))
                s.pb(i);
        solve(s);
    }
    vector<int>kq;
    for(int i=0;i<m;i++)
        if(ktr[i]==1)
            kq.pb(i);
    return kq;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n,m;
    cin>>n>>m;
    vector<int>u,v;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        u.pb(x);
        v.pb(y);
    }
    for(int i=1;i<n;i++)
    {
        int u;
        cin>>u;
      //  cout<<u<<endl;
        chon[u]=1;
    }
    vector<int>kq=find_roads(n,u,v);
    cout<<"ASK "<<query<<endl;
    for(int i=0;i<n-1;i++)cout<<kq[i]<<"\n";
    return 0;
}
#endif

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from simurgh.cpp:1:
simurgh.cpp: In function 'int my_ask(std::vector<int>)':
simurgh.cpp:64:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   64 |     assert(r.size()==n-1);
      |            ~~~~~~~~^~~~~
simurgh.cpp: In function 'void solve(std::vector<int>)':
simurgh.cpp:123:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |     for(int i=0;i<s.size();i++)
      |                 ~^~~~~~~~~
simurgh.cpp:124:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |         if(i*2<s.size())
      |            ~~~^~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1348 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 2 ms 1348 KB correct
8 Correct 2 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1348 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 2 ms 1236 KB correct
14 Correct 4 ms 1392 KB correct
15 Correct 4 ms 1364 KB correct
16 Correct 3 ms 1364 KB correct
17 Correct 4 ms 1352 KB correct
18 Correct 2 ms 1364 KB correct
19 Correct 3 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1372 KB correct
23 Correct 2 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 2 ms 1364 KB correct
26 Correct 2 ms 1348 KB correct
27 Correct 1 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 1 ms 1340 KB correct
30 Correct 2 ms 1364 KB correct
31 Correct 2 ms 1364 KB correct
32 Correct 2 ms 1364 KB correct
33 Correct 2 ms 1364 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1348 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 2 ms 1348 KB correct
8 Correct 2 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1348 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 2 ms 1236 KB correct
14 Correct 4 ms 1392 KB correct
15 Correct 4 ms 1364 KB correct
16 Correct 3 ms 1364 KB correct
17 Correct 4 ms 1352 KB correct
18 Correct 2 ms 1364 KB correct
19 Correct 3 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1372 KB correct
23 Correct 2 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 2 ms 1364 KB correct
26 Correct 2 ms 1348 KB correct
27 Correct 1 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 1 ms 1340 KB correct
30 Correct 2 ms 1364 KB correct
31 Correct 2 ms 1364 KB correct
32 Correct 2 ms 1364 KB correct
33 Correct 2 ms 1364 KB correct
34 Correct 112 ms 2228 KB correct
35 Correct 106 ms 2200 KB correct
36 Correct 79 ms 1944 KB correct
37 Correct 15 ms 1424 KB correct
38 Correct 121 ms 2228 KB correct
39 Correct 95 ms 2088 KB correct
40 Correct 80 ms 1944 KB correct
41 Correct 109 ms 2344 KB correct
42 Correct 104 ms 2232 KB correct
43 Correct 36 ms 1744 KB correct
44 Correct 25 ms 1620 KB correct
45 Correct 34 ms 1744 KB correct
46 Correct 21 ms 1620 KB correct
47 Correct 10 ms 1492 KB correct
48 Correct 3 ms 1364 KB correct
49 Correct 5 ms 1356 KB correct
50 Correct 9 ms 1488 KB correct
51 Correct 30 ms 1748 KB correct
52 Correct 25 ms 1736 KB correct
53 Correct 21 ms 1692 KB correct
54 Correct 33 ms 1824 KB correct
55 Correct 36 ms 1796 KB correct
56 Correct 32 ms 1808 KB correct
57 Correct 35 ms 1788 KB correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 401 ms 3852 KB correct
4 Correct 712 ms 5324 KB correct
5 Correct 703 ms 5368 KB correct
6 Correct 730 ms 5308 KB correct
7 Correct 748 ms 5280 KB correct
8 Correct 759 ms 5248 KB correct
9 Correct 724 ms 5296 KB correct
10 Correct 751 ms 5276 KB correct
11 Correct 741 ms 5280 KB correct
12 Correct 737 ms 5280 KB correct
13 Correct 1 ms 1236 KB correct
14 Correct 727 ms 5284 KB correct
15 Correct 725 ms 5276 KB correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 1 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1348 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 2 ms 1348 KB correct
8 Correct 2 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1348 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 2 ms 1236 KB correct
14 Correct 4 ms 1392 KB correct
15 Correct 4 ms 1364 KB correct
16 Correct 3 ms 1364 KB correct
17 Correct 4 ms 1352 KB correct
18 Correct 2 ms 1364 KB correct
19 Correct 3 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1372 KB correct
23 Correct 2 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 2 ms 1364 KB correct
26 Correct 2 ms 1348 KB correct
27 Correct 1 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 1 ms 1340 KB correct
30 Correct 2 ms 1364 KB correct
31 Correct 2 ms 1364 KB correct
32 Correct 2 ms 1364 KB correct
33 Correct 2 ms 1364 KB correct
34 Correct 112 ms 2228 KB correct
35 Correct 106 ms 2200 KB correct
36 Correct 79 ms 1944 KB correct
37 Correct 15 ms 1424 KB correct
38 Correct 121 ms 2228 KB correct
39 Correct 95 ms 2088 KB correct
40 Correct 80 ms 1944 KB correct
41 Correct 109 ms 2344 KB correct
42 Correct 104 ms 2232 KB correct
43 Correct 36 ms 1744 KB correct
44 Correct 25 ms 1620 KB correct
45 Correct 34 ms 1744 KB correct
46 Correct 21 ms 1620 KB correct
47 Correct 10 ms 1492 KB correct
48 Correct 3 ms 1364 KB correct
49 Correct 5 ms 1356 KB correct
50 Correct 9 ms 1488 KB correct
51 Correct 30 ms 1748 KB correct
52 Correct 25 ms 1736 KB correct
53 Correct 21 ms 1692 KB correct
54 Correct 33 ms 1824 KB correct
55 Correct 36 ms 1796 KB correct
56 Correct 32 ms 1808 KB correct
57 Correct 35 ms 1788 KB correct
58 Correct 1 ms 1236 KB correct
59 Correct 1 ms 1236 KB correct
60 Correct 401 ms 3852 KB correct
61 Correct 712 ms 5324 KB correct
62 Correct 703 ms 5368 KB correct
63 Correct 730 ms 5308 KB correct
64 Correct 748 ms 5280 KB correct
65 Correct 759 ms 5248 KB correct
66 Correct 724 ms 5296 KB correct
67 Correct 751 ms 5276 KB correct
68 Correct 741 ms 5280 KB correct
69 Correct 737 ms 5280 KB correct
70 Correct 1 ms 1236 KB correct
71 Correct 727 ms 5284 KB correct
72 Correct 725 ms 5276 KB correct
73 Correct 1 ms 1236 KB correct
74 Incorrect 732 ms 5288 KB WA in grader: NO
75 Halted 0 ms 0 KB -