oj.uz

Submission #82919

# Submission time Handle Problem Language Result Execution time Memory
82919 2018-11-02T20:39:05 Z Bodo171 Bitaro’s Party (JOI18_bitaro) C++14
100 / 100
 1545 ms 286672 KB 
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
const int nmax=100005;
typedef pair<int,int> P;
vector<int> v[nmax];
P l[nmax][350],all[1000];
int viz[nmax],block[nmax],rep[nmax],nr[nmax],dp[nmax],ap[nmax];
int N,n,m,q,i,j,k,a,b,x,nod,p,spec;
bool comp(P unu,P doi)
{
    return unu.first>doi.first;
}
void dfs(int x)
{
    viz[x]=1;
    for(int i=0;i<v[x].size();i++)
      if(!viz[v[x][i]])
        dfs(v[x][i]);
    rep[++N]=x;
}
int cat,merges;
void mrg(int a,int b)
{
    ++merges;
    merge(l[a]+1,l[a]+nr[a]+1,l[b]+1,l[b]+nr[b]+1,all+1,comp);
    cat=nr[a]+nr[b];nr[a]=0;
    for(int it=1;it<=cat&&nr[a]<=k;it++)
    {
        if(ap[all[it].second]!=merges)
        {
            l[a][++nr[a]]=all[it];
            ap[all[it].second]=merges;
        }
    }
}
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m>>q;
    for(k=1;k*k<=n;k++);
    for(i=1;i<=m;i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
    }
    for(int id=1;id<=n;id++)
        if(!viz[id])
          dfs(id);
    for(int id=N;id>=1;id--)
    {
        x=rep[id];
        for(int i=1;i<=nr[x];i++)
            l[x][i].first++;
        if(nr[x]<=k) l[x][++nr[x]]={1,x};
        for(int i=0;i<v[x].size();i++)
            mrg(v[x][i],x);
    }
    for(int cnt=1;cnt<=q;cnt++)
    {
        cin>>spec>>N;
        for(int i=1;i<=N;i++)
        {
            cin>>x;
            block[x]=cnt;
        }
        if(N<=k)
        {
            p=1;
            while(block[l[spec][p].second]==cnt)
                p++;
            cout<<l[spec][p].first-1<<'\n';
        }
        else
        {
            for(i=1;i<=n;i++)
                if(block[i]==cnt) dp[i]=0;
                else dp[i]=1;
            for(int id=n; id>=1; id--)
            {
                x=rep[id];
                if(dp[x])
                for(int i=0; i<v[x].size(); i++)
                    dp[v[x][i]]=max(dp[v[x][i]],dp[x]+1);
            }
            cout<<dp[spec]-1<<'\n';
        }
    }
    return 0;
}

Compilation message

bitaro.cpp: In function 'void dfs(int)':
bitaro.cpp:19:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
bitaro.cpp: In function 'int main()':
bitaro.cpp:59:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<v[x].size();i++)
                     ~^~~~~~~~~~~~
bitaro.cpp:86:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i=0; i<v[x].size(); i++)
                              ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2804 KB Output is correct
3 Correct 12 ms 2880 KB Output is correct
4 Correct 5 ms 2880 KB Output is correct
5 Correct 8 ms 5600 KB Output is correct
6 Correct 6 ms 5728 KB Output is correct
7 Correct 9 ms 5728 KB Output is correct
8 Correct 8 ms 5744 KB Output is correct
9 Correct 8 ms 5768 KB Output is correct
10 Correct 8 ms 5800 KB Output is correct
11 Correct 7 ms 5800 KB Output is correct
12 Correct 8 ms 5800 KB Output is correct
13 Correct 8 ms 5800 KB Output is correct
14 Correct 9 ms 5884 KB Output is correct
15 Correct 8 ms 5884 KB Output is correct
16 Correct 7 ms 5884 KB Output is correct
17 Correct 11 ms 5884 KB Output is correct
18 Correct 8 ms 5884 KB Output is correct
19 Correct 7 ms 5884 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2804 KB Output is correct
3 Correct 12 ms 2880 KB Output is correct
4 Correct 5 ms 2880 KB Output is correct
5 Correct 8 ms 5600 KB Output is correct
6 Correct 6 ms 5728 KB Output is correct
7 Correct 9 ms 5728 KB Output is correct
8 Correct 8 ms 5744 KB Output is correct
9 Correct 8 ms 5768 KB Output is correct
10 Correct 8 ms 5800 KB Output is correct
11 Correct 7 ms 5800 KB Output is correct
12 Correct 8 ms 5800 KB Output is correct
13 Correct 8 ms 5800 KB Output is correct
14 Correct 9 ms 5884 KB Output is correct
15 Correct 8 ms 5884 KB Output is correct
16 Correct 7 ms 5884 KB Output is correct
17 Correct 11 ms 5884 KB Output is correct
18 Correct 8 ms 5884 KB Output is correct
19 Correct 7 ms 5884 KB Output is correct
20 Correct 99 ms 6908 KB Output is correct
21 Correct 147 ms 6988 KB Output is correct
22 Correct 106 ms 7000 KB Output is correct
23 Correct 101 ms 7012 KB Output is correct
24 Correct 831 ms 281828 KB Output is correct
25 Correct 856 ms 281828 KB Output is correct
26 Correct 921 ms 281828 KB Output is correct
27 Correct 892 ms 285684 KB Output is correct
28 Correct 949 ms 285684 KB Output is correct
29 Correct 894 ms 285684 KB Output is correct
30 Correct 930 ms 285684 KB Output is correct
31 Correct 1046 ms 285684 KB Output is correct
32 Correct 866 ms 285684 KB Output is correct
33 Correct 744 ms 285684 KB Output is correct
34 Correct 679 ms 285684 KB Output is correct
35 Correct 713 ms 285684 KB Output is correct
36 Correct 838 ms 285684 KB Output is correct
37 Correct 721 ms 285684 KB Output is correct
38 Correct 837 ms 285684 KB Output is correct

Subtask #3
86.0 / 86.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2804 KB Output is correct
3 Correct 12 ms 2880 KB Output is correct
4 Correct 5 ms 2880 KB Output is correct
5 Correct 8 ms 5600 KB Output is correct
6 Correct 6 ms 5728 KB Output is correct
7 Correct 9 ms 5728 KB Output is correct
8 Correct 8 ms 5744 KB Output is correct
9 Correct 8 ms 5768 KB Output is correct
10 Correct 8 ms 5800 KB Output is correct
11 Correct 7 ms 5800 KB Output is correct
12 Correct 8 ms 5800 KB Output is correct
13 Correct 8 ms 5800 KB Output is correct
14 Correct 9 ms 5884 KB Output is correct
15 Correct 8 ms 5884 KB Output is correct
16 Correct 7 ms 5884 KB Output is correct
17 Correct 11 ms 5884 KB Output is correct
18 Correct 8 ms 5884 KB Output is correct
19 Correct 7 ms 5884 KB Output is correct
20 Correct 99 ms 6908 KB Output is correct
21 Correct 147 ms 6988 KB Output is correct
22 Correct 106 ms 7000 KB Output is correct
23 Correct 101 ms 7012 KB Output is correct
24 Correct 831 ms 281828 KB Output is correct
25 Correct 856 ms 281828 KB Output is correct
26 Correct 921 ms 281828 KB Output is correct
27 Correct 892 ms 285684 KB Output is correct
28 Correct 949 ms 285684 KB Output is correct
29 Correct 894 ms 285684 KB Output is correct
30 Correct 930 ms 285684 KB Output is correct
31 Correct 1046 ms 285684 KB Output is correct
32 Correct 866 ms 285684 KB Output is correct
33 Correct 744 ms 285684 KB Output is correct
34 Correct 679 ms 285684 KB Output is correct
35 Correct 713 ms 285684 KB Output is correct
36 Correct 838 ms 285684 KB Output is correct
37 Correct 721 ms 285684 KB Output is correct
38 Correct 837 ms 285684 KB Output is correct
39 Correct 1094 ms 285684 KB Output is correct
40 Correct 924 ms 285684 KB Output is correct
41 Correct 1065 ms 285684 KB Output is correct
42 Correct 1223 ms 285684 KB Output is correct
43 Correct 858 ms 285684 KB Output is correct
44 Correct 306 ms 285684 KB Output is correct
45 Correct 135 ms 285684 KB Output is correct
46 Correct 427 ms 285684 KB Output is correct
47 Correct 142 ms 285684 KB Output is correct
48 Correct 112 ms 285684 KB Output is correct
49 Correct 1135 ms 285684 KB Output is correct
50 Correct 866 ms 285684 KB Output is correct
51 Correct 293 ms 285684 KB Output is correct
52 Correct 347 ms 285684 KB Output is correct
53 Correct 1081 ms 285684 KB Output is correct
54 Correct 1039 ms 285684 KB Output is correct
55 Correct 854 ms 285684 KB Output is correct
56 Correct 827 ms 285684 KB Output is correct
57 Correct 304 ms 285684 KB Output is correct
58 Correct 298 ms 285684 KB Output is correct
59 Correct 331 ms 285684 KB Output is correct
60 Correct 315 ms 285684 KB Output is correct
61 Correct 1121 ms 285684 KB Output is correct
62 Correct 1370 ms 285684 KB Output is correct
63 Correct 1397 ms 285684 KB Output is correct
64 Correct 1340 ms 285684 KB Output is correct
65 Correct 1524 ms 285684 KB Output is correct
66 Correct 1545 ms 285684 KB Output is correct
67 Correct 912 ms 285684 KB Output is correct
68 Correct 962 ms 285684 KB Output is correct
69 Correct 957 ms 285684 KB Output is correct
70 Correct 932 ms 286096 KB Output is correct
71 Correct 965 ms 286096 KB Output is correct
72 Correct 867 ms 286096 KB Output is correct
73 Correct 923 ms 286236 KB Output is correct
74 Correct 973 ms 286236 KB Output is correct
75 Correct 890 ms 286236 KB Output is correct
76 Correct 1086 ms 286672 KB Output is correct
77 Correct 835 ms 286672 KB Output is correct
78 Correct 842 ms 286672 KB Output is correct
79 Correct 299 ms 286672 KB Output is correct
80 Correct 348 ms 286672 KB Output is correct
81 Correct 112 ms 286672 KB Output is correct
82 Correct 1103 ms 286672 KB Output is correct
83 Correct 1124 ms 286672 KB Output is correct
84 Correct 882 ms 286672 KB Output is correct
85 Correct 1057 ms 286672 KB Output is correct
86 Correct 980 ms 286672 KB Output is correct
87 Correct 948 ms 286672 KB Output is correct
88 Correct 305 ms 286672 KB Output is correct
89 Correct 303 ms 286672 KB Output is correct
90 Correct 343 ms 286672 KB Output is correct
91 Correct 362 ms 286672 KB Output is correct
92 Correct 136 ms 286672 KB Output is correct
93 Correct 109 ms 286672 KB Output is correct
94 Correct 971 ms 286672 KB Output is correct
95 Correct 981 ms 286672 KB Output is correct
96 Correct 741 ms 286672 KB Output is correct
97 Correct 713 ms 286672 KB Output is correct
98 Correct 791 ms 286672 KB Output is correct
99 Correct 725 ms 286672 KB Output is correct
100 Correct 288 ms 286672 KB Output is correct
101 Correct 298 ms 286672 KB Output is correct
102 Correct 378 ms 286672 KB Output is correct
103 Correct 348 ms 286672 KB Output is correct
104 Correct 103 ms 286672 KB Output is correct
105 Correct 99 ms 286672 KB Output is correct
106 Correct 1057 ms 286672 KB Output is correct
107 Correct 1034 ms 286672 KB Output is correct
108 Correct 857 ms 286672 KB Output is correct
109 Correct 944 ms 286672 KB Output is correct
110 Correct 894 ms 286672 KB Output is correct
111 Correct 925 ms 286672 KB Output is correct
112 Correct 311 ms 286672 KB Output is correct
113 Correct 314 ms 286672 KB Output is correct
114 Correct 357 ms 286672 KB Output is correct
115 Correct 362 ms 286672 KB Output is correct
116 Correct 110 ms 286672 KB Output is correct
117 Correct 94 ms 286672 KB Output is correct
118 Correct 913 ms 286672 KB Output is correct
119 Correct 839 ms 286672 KB Output is correct
120 Correct 851 ms 286672 KB Output is correct
121 Correct 855 ms 286672 KB Output is correct
122 Correct 855 ms 286672 KB Output is correct
123 Correct 831 ms 286672 KB Output is correct
124 Correct 819 ms 286672 KB Output is correct
125 Correct 843 ms 286672 KB Output is correct
126 Correct 812 ms 286672 KB Output is correct