답안 #927403

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
927403	2024-02-14T20:05:30 Z	VMaksimoski008	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	163 ms	22612 KB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
 
struct DSU {
    int n, comp;
    vector<int> par, size;
 
    void config(int _n) {
        n = _n + 1;
        comp = _n;
        par.resize(n+1);
        size.resize(n+1, 1);
        for(int i=1; i<=n; i++) par[i] = i;
    }
 
    int get(int u) {
        if(u == par[u]) return u;
        return par[u] = get(par[u]);
    }
 
    bool uni(int u, int v) {
        u = get(u), v = get(v);
 
        if(u == v) return false;
        if(size[u] < size[v]) swap(u, v);
 
        size[u] += size[v];
        par[v] = u;
        comp--;
 
        return true;
    }
 
    int getComp() { return comp; }
    int getSize(int u) { return size[get(u)]; }
    bool sameSet(int u, int v) { return get(u) == get(v); }
    bool isLeader(int u) { return get(u) == u; }
};

vector<vector<int> > graph;
vector<bool> vis;
vector<int> G;

void dfs(int u) {
    vis[u] = 1;
    G.push_back(u);

    for(int &v : graph[u]) {
        if(vis[v]) continue;
        dfs(v);
    }
}
 
int construct(vector<vector<int> > p) {
    int n = p.size();
    vector<int> cnt(4);
    vector<vector<int> > B(n, vector<int>(n, 0));
    graph.resize(n);
    vis.resize(n);

    DSU dsu; dsu.config(n);

    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            cnt[p[i][j]]++;

    if(cnt[1] == n && cnt[1] + cnt[0] == n*n) {
        build(B);
        return 1;
    }

    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] == 1)
                if(dsu.uni(i, j)) B[i][j] = B[j][i] = 1;
        }
    }
 
    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(p[i][j] >= 1 && !dsu.sameSet(i, j)) return 0;
            if(p[i][j] == 0 && dsu.sameSet(i, j)) return 0;
        }
    }

    bool ok = 0;

    for(int i=0; i<n; i++) {
        for(int j=0; j<n; j++) {
            if(i != j && p[i][j] == 2 && dsu.isLeader(i) && dsu.isLeader(j)) {
                ok = 1;
                graph[i].push_back(j);
                graph[j].push_back(i);
            }
        }
    }

    for(int i=0; i<n && ok; i++) {
        if(vis[i]) continue;

        G.clear();
        dfs(i);

        if(G.size() == 2) return 0;
        if(G.size() == 1) continue;

        for(int i=0; i<G.size()-1; i++)
            for(int j=i+1; j<G.size(); j++)
                if(p[i][j] != 2) return 0;

        G.push_back(G[0]);
        for(int i=0; i<G.size()-1; i++)
            B[G[i]][G[i+1]] = B[G[i+1]][G[i]] = 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 i=0; i<G.size()-1; i++)
      |                      ~^~~~~~~~~~~
supertrees.cpp:109:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |             for(int j=i+1; j<G.size(); j++)
      |                            ~^~~~~~~~~
supertrees.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(int i=0; i<G.size()-1; i++)
      |                      ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1292 KB	Output is correct
7	Correct	159 ms	22096 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1292 KB	Output is correct
7	Correct	159 ms	22096 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1116 KB	Output is correct
13	Correct	146 ms	22196 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	70 ms	12060 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	38 ms	5720 KB	Output is correct
21	Correct	153 ms	22024 KB	Output is correct
22	Correct	163 ms	22612 KB	Output is correct
23	Correct	157 ms	22096 KB	Output is correct
24	Correct	160 ms	22008 KB	Output is correct
25	Correct	62 ms	12292 KB	Output is correct
26	Correct	62 ms	12112 KB	Output is correct
27	Correct	160 ms	22096 KB	Output is correct
28	Correct	149 ms	22100 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	600 KB	Output is correct
4	Correct	344 KB	Output is correct
5	Incorrect	348 KB	Answer gives possible 0 while actual possible 1
6	Halted	0 KB	-

Subtask #4
0 / 35.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Incorrect	348 KB	Answer gives possible 0 while actual possible 1
3	Halted	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1292 KB	Output is correct
7	Correct	159 ms	22096 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1116 KB	Output is correct
13	Correct	146 ms	22196 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	70 ms	12060 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	38 ms	5720 KB	Output is correct
21	Correct	153 ms	22024 KB	Output is correct
22	Correct	163 ms	22612 KB	Output is correct
23	Correct	157 ms	22096 KB	Output is correct
24	Correct	160 ms	22008 KB	Output is correct
25	Correct	62 ms	12292 KB	Output is correct
26	Correct	62 ms	12112 KB	Output is correct
27	Correct	160 ms	22096 KB	Output is correct
28	Correct	149 ms	22100 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	600 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
34	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	6 ms	1292 KB	Output is correct
7	Correct	159 ms	22096 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	6 ms	1116 KB	Output is correct
13	Correct	146 ms	22196 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	3 ms	860 KB	Output is correct
17	Correct	70 ms	12060 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	38 ms	5720 KB	Output is correct
21	Correct	153 ms	22024 KB	Output is correct
22	Correct	163 ms	22612 KB	Output is correct
23	Correct	157 ms	22096 KB	Output is correct
24	Correct	160 ms	22008 KB	Output is correct
25	Correct	62 ms	12292 KB	Output is correct
26	Correct	62 ms	12112 KB	Output is correct
27	Correct	160 ms	22096 KB	Output is correct
28	Correct	149 ms	22100 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	600 KB	Output is correct
32	Correct	0 ms	344 KB	Output is correct
33	Incorrect	0 ms	348 KB	Answer gives possible 0 while actual possible 1
34	Halted	0 ms	0 KB	-

답안 #927403

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0