oj.uz

Submission #301500

# Submission time Handle Problem Language Result Execution time Memory
301500 2020-09-18T03:09:51 Z qiangbao Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 254 ms 26236 KB 
#include <iostream>
#include <vector>
#include "supertrees.h"

#define pb push_back

using namespace std;

int n;
vector<vector<int> > a;

int vis[1001], vis2[1001];
vector<int> belong;
int gp[1001], gplwch[1001];
vector<int> gpl;

int fans=1;
vector<int> plamt;
vector<vector<int> > ans;

void dfs(int x)
{
    int i;
    
    vis[x]=1, belong.pb(x);
    for(i=0;i<n;i++)
        if(a[x][i] && !vis[i])
            vis[i]=1, dfs(i);
}

void wk2()
{
    int i, j;
    
    for(i=0;i<belong.size();i++){
        int f=belong[i];
        if(!vis2[f]){
            vis2[f]=true;
            gp[f]=i, gpl.pb(f), gplwch[i]=f;
            for(j=0;j<n;j++)
                if(a[f][j]==1)
                    gp[j]=i, vis2[j]=true;
        }
    }
    // circle
    if(gpl.size()>=3){
        for(i=0;i<gpl.size();i++)
            ans[gpl[i]][gpl[(i+1)%gpl.size()]]=ans[gpl[(i+1)%gpl.size()]][gpl[i]]=1;
    }
    if(gpl.size()==2)
        fans=0;
    for(i=0;i<belong.size();i++){
        int f=belong[i], f2=gp[f];
        if(gplwch[f2]!=f)
            ans[f][gplwch[f2]]=ans[gplwch[f2]][f]=1;
    }
}

void ck()
{
    int i, j;
    
    for(i=0;i<belong.size();i++)
        for(j=i+1;j<belong.size();j++){
            int f=belong[i], f2=belong[j];
            if((a[f][f2]==1 && gp[f]!=gp[f2]) || (a[f][f2]==2 && gp[f]==gp[f2]) || a[f][f2]==0)
                fans=0;
        }
}

void wk()
{
    int i;
    
    for(i=0;i<n;i++)
        if(!vis[i]){
            belong.clear();
            gpl.clear();
            dfs(i);
            wk2();
            ck();
        }
}

int construct(vector<vector<int> > p)
{
    int three=0;
    int i, j;
    a=p;
    
    n=p.size();
    for(i=0;i<n;i++)
        plamt.pb(0);
    for(i=0;i<n;i++)
        ans.pb(plamt);
    
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            if(a[i][j]==3)
                three=1;
    if(three) fans=0;
    else wk();
    
    if(fans)
        build(ans);
    return fans;
}

//int main()
//{
//    construct({{1, 2, 0}, {2, 1, 2}, {0, 2, 1}});
//
//    return 0;
//}

Compilation message

supertrees.cpp: In function 'void wk2()':
supertrees.cpp:35:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(i=0;i<belong.size();i++){
      |             ~^~~~~~~~~~~~~~
supertrees.cpp:47:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(i=0;i<gpl.size();i++)
      |                 ~^~~~~~~~~~~
supertrees.cpp:52:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |     for(i=0;i<belong.size();i++){
      |             ~^~~~~~~~~~~~~~
supertrees.cpp: In function 'void ck()':
supertrees.cpp:63:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(i=0;i<belong.size();i++)
      |             ~^~~~~~~~~~~~~~
supertrees.cpp:64:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for(j=i+1;j<belong.size();j++){
      |                   ~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1536 KB Output is correct
7 Correct 238 ms 26108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1536 KB Output is correct
7 Correct 238 ms 26108 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 240 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 140 ms 16376 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 6776 KB Output is correct
21 Correct 244 ms 26232 KB Output is correct
22 Correct 240 ms 26104 KB Output is correct
23 Correct 251 ms 26104 KB Output is correct
24 Correct 240 ms 26072 KB Output is correct
25 Correct 108 ms 16124 KB Output is correct
26 Correct 106 ms 16120 KB Output is correct
27 Correct 254 ms 26232 KB Output is correct
28 Correct 243 ms 26204 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 11 ms 1408 KB Output is correct
9 Correct 238 ms 26236 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 10 ms 1408 KB Output is correct
13 Correct 240 ms 26232 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 119 ms 16120 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 60 ms 6780 KB Output is correct
22 Correct 240 ms 26104 KB Output is correct
23 Correct 236 ms 26104 KB Output is correct
24 Correct 249 ms 26104 KB Output is correct
25 Correct 109 ms 16120 KB Output is correct
26 Correct 107 ms 16120 KB Output is correct
27 Correct 237 ms 26128 KB Output is correct
28 Correct 252 ms 26104 KB Output is correct
29 Correct 102 ms 16120 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 60 ms 6816 KB Output is correct
5 Correct 241 ms 26028 KB Output is correct
6 Correct 241 ms 26208 KB Output is correct
7 Correct 248 ms 26104 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 60 ms 6776 KB Output is correct
10 Correct 241 ms 26104 KB Output is correct
11 Correct 240 ms 26232 KB Output is correct
12 Correct 254 ms 26104 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 59 ms 6776 KB Output is correct
17 Correct 242 ms 26080 KB Output is correct
18 Correct 238 ms 26104 KB Output is correct
19 Correct 246 ms 26232 KB Output is correct
20 Correct 235 ms 26104 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1536 KB Output is correct
7 Correct 238 ms 26108 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 240 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 140 ms 16376 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 6776 KB Output is correct
21 Correct 244 ms 26232 KB Output is correct
22 Correct 240 ms 26104 KB Output is correct
23 Correct 251 ms 26104 KB Output is correct
24 Correct 240 ms 26072 KB Output is correct
25 Correct 108 ms 16124 KB Output is correct
26 Correct 106 ms 16120 KB Output is correct
27 Correct 254 ms 26232 KB Output is correct
28 Correct 243 ms 26204 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 238 ms 26236 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 10 ms 1408 KB Output is correct
41 Correct 240 ms 26232 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 119 ms 16120 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 60 ms 6780 KB Output is correct
50 Correct 240 ms 26104 KB Output is correct
51 Correct 236 ms 26104 KB Output is correct
52 Correct 249 ms 26104 KB Output is correct
53 Correct 109 ms 16120 KB Output is correct
54 Correct 107 ms 16120 KB Output is correct
55 Correct 237 ms 26128 KB Output is correct
56 Correct 252 ms 26104 KB Output is correct
57 Correct 102 ms 16120 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 5 ms 1024 KB Output is correct
61 Correct 121 ms 16120 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 62 ms 6904 KB Output is correct
66 Correct 110 ms 16248 KB Output is correct
67 Correct 107 ms 16120 KB Output is correct
68 Correct 105 ms 16248 KB Output is correct
69 Correct 105 ms 16120 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 11 ms 1536 KB Output is correct
7 Correct 238 ms 26108 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 12 ms 1408 KB Output is correct
13 Correct 240 ms 26104 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 5 ms 1024 KB Output is correct
17 Correct 140 ms 16376 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 59 ms 6776 KB Output is correct
21 Correct 244 ms 26232 KB Output is correct
22 Correct 240 ms 26104 KB Output is correct
23 Correct 251 ms 26104 KB Output is correct
24 Correct 240 ms 26072 KB Output is correct
25 Correct 108 ms 16124 KB Output is correct
26 Correct 106 ms 16120 KB Output is correct
27 Correct 254 ms 26232 KB Output is correct
28 Correct 243 ms 26204 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 11 ms 1408 KB Output is correct
37 Correct 238 ms 26236 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 10 ms 1408 KB Output is correct
41 Correct 240 ms 26232 KB Output is correct
42 Correct 0 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 5 ms 1024 KB Output is correct
45 Correct 119 ms 16120 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 60 ms 6780 KB Output is correct
50 Correct 240 ms 26104 KB Output is correct
51 Correct 236 ms 26104 KB Output is correct
52 Correct 249 ms 26104 KB Output is correct
53 Correct 109 ms 16120 KB Output is correct
54 Correct 107 ms 16120 KB Output is correct
55 Correct 237 ms 26128 KB Output is correct
56 Correct 252 ms 26104 KB Output is correct
57 Correct 102 ms 16120 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 60 ms 6816 KB Output is correct
62 Correct 241 ms 26028 KB Output is correct
63 Correct 241 ms 26208 KB Output is correct
64 Correct 248 ms 26104 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 60 ms 6776 KB Output is correct
67 Correct 241 ms 26104 KB Output is correct
68 Correct 240 ms 26232 KB Output is correct
69 Correct 254 ms 26104 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 59 ms 6776 KB Output is correct
74 Correct 242 ms 26080 KB Output is correct
75 Correct 238 ms 26104 KB Output is correct
76 Correct 246 ms 26232 KB Output is correct
77 Correct 235 ms 26104 KB Output is correct
78 Correct 0 ms 384 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 5 ms 1024 KB Output is correct
81 Correct 121 ms 16120 KB Output is correct
82 Correct 1 ms 384 KB Output is correct
83 Correct 1 ms 384 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 62 ms 6904 KB Output is correct
86 Correct 110 ms 16248 KB Output is correct
87 Correct 107 ms 16120 KB Output is correct
88 Correct 105 ms 16248 KB Output is correct
89 Correct 105 ms 16120 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 1024 KB Output is correct
93 Correct 104 ms 16120 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 384 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 26 ms 4344 KB Output is correct
98 Correct 104 ms 16120 KB Output is correct
99 Correct 105 ms 16120 KB Output is correct
100 Correct 102 ms 16120 KB Output is correct
101 Correct 104 ms 16120 KB Output is correct
102 Correct 106 ms 16120 KB Output is correct
103 Correct 105 ms 16124 KB Output is correct
104 Correct 101 ms 16120 KB Output is correct
105 Correct 106 ms 16120 KB Output is correct