oj.uz

답안 #964038

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964038 2024-04-16T08:37:06 Z SuPythony 슈퍼트리 잇기 (IOI20_supertrees) C++17
19 / 100
 171 ms 24160 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
class DSU {
    vector<int> par;
    vector<int> siz;
 
public:
    DSU(int n) {
        par.resize(n);
        iota(par.begin(),par.end(),0);
        siz.assign(n,1);
    }
 
    int find_set(int u) {
        if (par[u]==u) return u;
        return par[u]=find_set(par[u]);
    }
 
    bool is_same(int u, int v) {
        return find_set(u)==find_set(v);
    }
 
    bool unite_set(int u, int v) {
        u=find_set(u);
        v=find_set(v);
        if (u==v) return false;
        if (siz[u]<siz[v]) swap(u,v);
        par[v]=u;
        siz[u]+=siz[v];
        return true;
    }
};
 
int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> ans(n,vector<int>(n,0));
    DSU dsu=DSU(n);
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (i==j) continue;
            if (p[i][j]==2) {
                dsu.unite_set(i,j);
            }
        }
    }
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if (p[i][j]==0&&dsu.is_same(i,j)) {
                return 0;
            }
        }
    }
    unordered_map<int,vector<int>> m;
    for (int i=0; i<n; i++) {
        m[dsu.find_set(i)].push_back(i);
    }
    for (auto i: m) {
        vector<int> v=i.second;
        if (v.size()==1||v.size()==0) continue;
        if (v.size()==2) return 0;
        ans[v.front()][v.back()]=1;
        ans[v.back()][v.front()]=1;
        for (int j=0; j<v.size()-1; j++) {
            ans[v[j]][v[j+1]]=1;
            ans[v[j+1]][v[j]]=1;
        }
    }
    build(ans);
    return 1;
}

Compilation message

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

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 500 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 500 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 8 ms 1372 KB Output is correct
9 Correct 163 ms 24160 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 162 ms 24012 KB Output is correct
14 Correct 0 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 83 ms 14200 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 40 ms 6224 KB Output is correct
22 Correct 170 ms 24056 KB Output is correct
23 Correct 161 ms 23940 KB Output is correct
24 Correct 171 ms 24060 KB Output is correct
25 Correct 67 ms 14164 KB Output is correct
26 Correct 67 ms 13992 KB Output is correct
27 Correct 158 ms 23924 KB Output is correct
28 Correct 165 ms 23924 KB Output is correct
29 Correct 67 ms 14112 KB Output is correct

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Too few ways to get from 1 to 2, should be 1 found 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 500 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 500 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -