oj.uz

답안 #719243

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
719243 2023-04-05T16:48:28 Z bin9638 Simurgh (IOI17_simurgh) C++17
100 / 100
 914 ms 5280 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;
}

int solve(vector<int>s)
{
    if(s.empty())
        return 0;
    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);
    int res=my_ask(hoi)-val;
    if(res==0)
    {
        for(auto u:s)
            ktr[u]=0;
        return res;
    }
    if(res==s.size())
    {
        for(auto u:s)
            ktr[u]=1;
        return res;
    }
    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]);
    if(solve(L)==res)
        return res;
    solve(R);
    return res;
}

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 'int solve(std::vector<int>)':
simurgh.cpp:118:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |     if(res==s.size())
      |        ~~~^~~~~~~~~~
simurgh.cpp:125:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |     for(int i=0;i<s.size();i++)
      |                 ~^~~~~~~~~
simurgh.cpp:126:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |         if(i*2<s.size())
      |            ~~~^~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 2 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1236 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 1 ms 1236 KB correct
8 Correct 1 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1236 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 1 ms 1348 KB correct
14 Correct 3 ms 1364 KB correct
15 Correct 5 ms 1352 KB correct
16 Correct 4 ms 1364 KB correct
17 Correct 4 ms 1392 KB correct
18 Correct 2 ms 1360 KB correct
19 Correct 4 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1364 KB correct
23 Correct 3 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 1 ms 1364 KB correct
26 Correct 2 ms 1364 KB correct
27 Correct 2 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 2 ms 1364 KB correct
30 Correct 3 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 2 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1236 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 1 ms 1236 KB correct
8 Correct 1 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1236 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 1 ms 1348 KB correct
14 Correct 3 ms 1364 KB correct
15 Correct 5 ms 1352 KB correct
16 Correct 4 ms 1364 KB correct
17 Correct 4 ms 1392 KB correct
18 Correct 2 ms 1360 KB correct
19 Correct 4 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1364 KB correct
23 Correct 3 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 1 ms 1364 KB correct
26 Correct 2 ms 1364 KB correct
27 Correct 2 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 2 ms 1364 KB correct
30 Correct 3 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 116 ms 2164 KB correct
35 Correct 116 ms 2132 KB correct
36 Correct 82 ms 1928 KB correct
37 Correct 16 ms 1404 KB correct
38 Correct 110 ms 2268 KB correct
39 Correct 102 ms 2056 KB correct
40 Correct 86 ms 1824 KB correct
41 Correct 134 ms 2164 KB correct
42 Correct 121 ms 2164 KB correct
43 Correct 37 ms 1808 KB correct
44 Correct 25 ms 1620 KB correct
45 Correct 32 ms 1748 KB correct
46 Correct 28 ms 1636 KB correct
47 Correct 10 ms 1492 KB correct
48 Correct 4 ms 1364 KB correct
49 Correct 7 ms 1408 KB correct
50 Correct 11 ms 1492 KB correct
51 Correct 33 ms 1748 KB correct
52 Correct 28 ms 1620 KB correct
53 Correct 24 ms 1620 KB correct
54 Correct 39 ms 1744 KB correct
55 Correct 37 ms 1800 KB correct
56 Correct 38 ms 1788 KB correct
57 Correct 38 ms 1748 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 472 ms 3504 KB correct
4 Correct 914 ms 4604 KB correct
5 Correct 882 ms 4572 KB correct
6 Correct 890 ms 4604 KB correct
7 Correct 903 ms 4608 KB correct
8 Correct 862 ms 4604 KB correct
9 Correct 858 ms 4604 KB correct
10 Correct 804 ms 4600 KB correct
11 Correct 792 ms 4620 KB correct
12 Correct 811 ms 4680 KB correct
13 Correct 1 ms 1236 KB correct
14 Correct 820 ms 4604 KB correct
15 Correct 800 ms 4656 KB correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB correct
2 Correct 2 ms 1236 KB correct
3 Correct 1 ms 1236 KB correct
4 Correct 1 ms 1236 KB correct
5 Correct 1 ms 1236 KB correct
6 Correct 1 ms 1236 KB correct
7 Correct 1 ms 1236 KB correct
8 Correct 1 ms 1236 KB correct
9 Correct 1 ms 1236 KB correct
10 Correct 1 ms 1236 KB correct
11 Correct 1 ms 1236 KB correct
12 Correct 1 ms 1236 KB correct
13 Correct 1 ms 1348 KB correct
14 Correct 3 ms 1364 KB correct
15 Correct 5 ms 1352 KB correct
16 Correct 4 ms 1364 KB correct
17 Correct 4 ms 1392 KB correct
18 Correct 2 ms 1360 KB correct
19 Correct 4 ms 1364 KB correct
20 Correct 3 ms 1364 KB correct
21 Correct 4 ms 1364 KB correct
22 Correct 2 ms 1364 KB correct
23 Correct 3 ms 1364 KB correct
24 Correct 2 ms 1364 KB correct
25 Correct 1 ms 1364 KB correct
26 Correct 2 ms 1364 KB correct
27 Correct 2 ms 1364 KB correct
28 Correct 2 ms 1364 KB correct
29 Correct 2 ms 1364 KB correct
30 Correct 3 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 116 ms 2164 KB correct
35 Correct 116 ms 2132 KB correct
36 Correct 82 ms 1928 KB correct
37 Correct 16 ms 1404 KB correct
38 Correct 110 ms 2268 KB correct
39 Correct 102 ms 2056 KB correct
40 Correct 86 ms 1824 KB correct
41 Correct 134 ms 2164 KB correct
42 Correct 121 ms 2164 KB correct
43 Correct 37 ms 1808 KB correct
44 Correct 25 ms 1620 KB correct
45 Correct 32 ms 1748 KB correct
46 Correct 28 ms 1636 KB correct
47 Correct 10 ms 1492 KB correct
48 Correct 4 ms 1364 KB correct
49 Correct 7 ms 1408 KB correct
50 Correct 11 ms 1492 KB correct
51 Correct 33 ms 1748 KB correct
52 Correct 28 ms 1620 KB correct
53 Correct 24 ms 1620 KB correct
54 Correct 39 ms 1744 KB correct
55 Correct 37 ms 1800 KB correct
56 Correct 38 ms 1788 KB correct
57 Correct 38 ms 1748 KB correct
58 Correct 1 ms 1236 KB correct
59 Correct 1 ms 1236 KB correct
60 Correct 472 ms 3504 KB correct
61 Correct 914 ms 4604 KB correct
62 Correct 882 ms 4572 KB correct
63 Correct 890 ms 4604 KB correct
64 Correct 903 ms 4608 KB correct
65 Correct 862 ms 4604 KB correct
66 Correct 858 ms 4604 KB correct
67 Correct 804 ms 4600 KB correct
68 Correct 792 ms 4620 KB correct
69 Correct 811 ms 4680 KB correct
70 Correct 1 ms 1236 KB correct
71 Correct 820 ms 4604 KB correct
72 Correct 800 ms 4656 KB correct
73 Correct 1 ms 1236 KB correct
74 Correct 813 ms 4608 KB correct
75 Correct 762 ms 5140 KB correct
76 Correct 249 ms 2768 KB correct
77 Correct 815 ms 5280 KB correct
78 Correct 824 ms 5280 KB correct
79 Correct 799 ms 5276 KB correct
80 Correct 773 ms 5148 KB correct
81 Correct 655 ms 4564 KB correct
82 Correct 759 ms 5196 KB correct
83 Correct 405 ms 3332 KB correct
84 Correct 282 ms 3612 KB correct
85 Correct 253 ms 3284 KB correct
86 Correct 152 ms 2772 KB correct
87 Correct 106 ms 2348 KB correct
88 Correct 83 ms 2132 KB correct
89 Correct 74 ms 1996 KB correct
90 Correct 60 ms 1956 KB correct
91 Correct 13 ms 1364 KB correct
92 Correct 9 ms 1364 KB correct
93 Correct 254 ms 3404 KB correct
94 Correct 153 ms 2772 KB correct
95 Correct 142 ms 2644 KB correct
96 Correct 70 ms 2004 KB correct
97 Correct 81 ms 2124 KB correct
98 Correct 104 ms 2336 KB correct
99 Correct 84 ms 2168 KB correct
100 Correct 23 ms 1492 KB correct
101 Correct 9 ms 1364 KB correct
102 Correct 242 ms 3368 KB correct
103 Correct 241 ms 3284 KB correct
104 Correct 242 ms 3312 KB correct
105 Correct 236 ms 3204 KB correct