oj.uz

답안 #755067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
755067 2023-06-09T11:24:27 Z sofija6 슈퍼트리 잇기 (IOI20_supertrees) C++14
56 / 100
 255 ms 23260 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
#define MAXN 1010
using namespace std;
int d[MAXN];
int Root(int p)
{
    while (d[p]!=p)
    {
        d[p]=d[d[p]];
        p=d[p];
    }
    return p;
}
void Join(int p,int q)
{
    d[Root(p)]=d[Root(q)];
}
int construct(std::vector<std::vector<int>> p) {
    int n=p.size();
    for (int i=0;i<n;i++)
    {
        d[i]=i;
        for (int j=0;j<n;j++)
        {
            if (p[i][j]==3 || p[i][j]!=p[j][i])
                return 0;
        }
    }
    vector<int> v[n+2];
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            if (p[i][j]==1)
                Join(i,j);
        }
    }
    vector<vector<int> > b;
    b.resize(n);
    for (int i=0;i<n;i++)
        b[i].resize(n);
    for (int i=0;i<n;i++)
    {
        if (i==Root(i))
            continue;
        b[i][Root(i)]=1;
        b[Root(i)][i]=1;
    }
    bool cyc[n+2][n+2];
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
            cyc[i][j]=false;
    }
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<n;j++)
        {
            if (p[i][j]==2)
                cyc[Root(i)][Root(j)]=true;
        }
    }
    vector<int> root[n+2];
    for (int i=0;i<n;i++)
    {
        root[Root(i)].push_back(i);
        for (int j=0;j<n;j++)
        {
            if ((!p[i][j] && (Root(i)==Root(j) || cyc[Root(i)][Root(j)])) || (p[i][j]==1 && cyc[Root(i)][Root(j)]))
                return 0;
        }
    }
    bool vis[n+2]={false};
    for (int i=0;i<n;i++)
    {
        if (vis[i] || Root(i)!=i)
            continue;
        set<int> s;
        vector<int> v;
        int cur=i;
        while (true)
        {
            s.insert(cur);
            v.push_back(cur);
            vis[cur]=true;
            bool next=false;
            for (int j=cur+1;j<n;j++)
            {
                if (cyc[cur][j])
                {
                    cur=j;
                    next=true;
                    break;
                }
            }
            if (!next)
                break;
        }
        if (s.size()==2)
            return 0;
        if (s.size()==1)
        {
            if (cyc[cur][cur])
                return 0;
            continue;
        }
        for (int j=0;j<v.size();j++)
        {
            for (int k=0;k<v.size();k++)
            {
                if (j==k)
                    continue;
                for (auto U : root[v[j]])
                {
                    for (auto V : root[v[k]])
                    {
                        if (p[U][V]!=2)
                            return 0;
                    }
                }
            }
        }
        for (int j=0;j<v.size()-1;j++)
        {
            b[v[j]][v[j+1]]=1;
            b[v[j+1]][v[j]]=1;
        }
        b[v[v.size()-1]][v[0]]=1;
        b[v[0]][v[v.size()-1]]=1;
    }
    build(b);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:108:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         for (int j=0;j<v.size();j++)
      |                      ~^~~~~~~~~
supertrees.cpp:110:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |             for (int k=0;k<v.size();k++)
      |                          ~^~~~~~~~~
supertrees.cpp:124:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |         for (int j=0;j<v.size()-1;j++)
      |                      ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 11 ms 1236 KB Output is correct
7 Correct 187 ms 23052 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 11 ms 1236 KB Output is correct
7 Correct 187 ms 23052 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 176 ms 23060 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 83 ms 13068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5924 KB Output is correct
21 Correct 185 ms 23080 KB Output is correct
22 Correct 191 ms 23048 KB Output is correct
23 Correct 190 ms 23052 KB Output is correct
24 Correct 180 ms 22996 KB Output is correct
25 Correct 68 ms 13060 KB Output is correct
26 Correct 74 ms 13132 KB Output is correct
27 Correct 191 ms 23044 KB Output is correct
28 Correct 176 ms 22988 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 7 ms 1188 KB Output is correct
9 Correct 200 ms 23060 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 174 ms 23100 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 86 ms 13188 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 46 ms 5964 KB Output is correct
22 Correct 196 ms 23112 KB Output is correct
23 Correct 180 ms 23056 KB Output is correct
24 Correct 190 ms 23108 KB Output is correct
25 Correct 70 ms 13076 KB Output is correct
26 Incorrect 198 ms 23048 KB Answer gives possible 1 while actual possible 0
27 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 46 ms 6028 KB Output is correct
5 Correct 186 ms 23044 KB Output is correct
6 Correct 211 ms 23260 KB Output is correct
7 Correct 203 ms 23004 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 57 ms 5972 KB Output is correct
10 Correct 186 ms 23044 KB Output is correct
11 Correct 202 ms 23048 KB Output is correct
12 Correct 204 ms 23192 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 47 ms 6008 KB Output is correct
17 Correct 255 ms 23176 KB Output is correct
18 Correct 184 ms 22996 KB Output is correct
19 Correct 205 ms 23112 KB Output is correct
20 Correct 181 ms 23044 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 11 ms 1236 KB Output is correct
7 Correct 187 ms 23052 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 176 ms 23060 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 83 ms 13068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5924 KB Output is correct
21 Correct 185 ms 23080 KB Output is correct
22 Correct 191 ms 23048 KB Output is correct
23 Correct 190 ms 23052 KB Output is correct
24 Correct 180 ms 22996 KB Output is correct
25 Correct 68 ms 13060 KB Output is correct
26 Correct 74 ms 13132 KB Output is correct
27 Correct 191 ms 23044 KB Output is correct
28 Correct 176 ms 22988 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1188 KB Output is correct
37 Correct 200 ms 23060 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1236 KB Output is correct
41 Correct 174 ms 23100 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 86 ms 13188 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 46 ms 5964 KB Output is correct
50 Correct 196 ms 23112 KB Output is correct
51 Correct 180 ms 23056 KB Output is correct
52 Correct 190 ms 23108 KB Output is correct
53 Correct 70 ms 13076 KB Output is correct
54 Incorrect 198 ms 23048 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 11 ms 1236 KB Output is correct
7 Correct 187 ms 23052 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1236 KB Output is correct
13 Correct 176 ms 23060 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 83 ms 13068 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 57 ms 5924 KB Output is correct
21 Correct 185 ms 23080 KB Output is correct
22 Correct 191 ms 23048 KB Output is correct
23 Correct 190 ms 23052 KB Output is correct
24 Correct 180 ms 22996 KB Output is correct
25 Correct 68 ms 13060 KB Output is correct
26 Correct 74 ms 13132 KB Output is correct
27 Correct 191 ms 23044 KB Output is correct
28 Correct 176 ms 22988 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 7 ms 1188 KB Output is correct
37 Correct 200 ms 23060 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 8 ms 1236 KB Output is correct
41 Correct 174 ms 23100 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 86 ms 13188 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 46 ms 5964 KB Output is correct
50 Correct 196 ms 23112 KB Output is correct
51 Correct 180 ms 23056 KB Output is correct
52 Correct 190 ms 23108 KB Output is correct
53 Correct 70 ms 13076 KB Output is correct
54 Incorrect 198 ms 23048 KB Answer gives possible 1 while actual possible 0
55 Halted 0 ms 0 KB -