oj.uz

Submission #889101

# Submission time Handle Problem Language Result Execution time Memory
889101 2023-12-18T20:44:26 Z VMaksimoski008 Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 154 ms 27928 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

vector<vector<int> > mat;
vector<bool> vis;
vector<int> curr;

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

    for(int i=0; i<mat.size(); i++) {
        if(vis[i]) continue;
        if(!mat[u][i]) continue;
        dfs(i);
    }
}

int construct(vector<vector<int> > p) {
    int n = p.size();
    vector<int> cnt(4);
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++) cnt[p[i][j]]++;

    vector<vector<int> > b(n, vector<int>(n));

    if(cnt[1] == n * n) {
        for(int i=1; i<n; i++)
            b[i-1][i] = 1, b[i][i-1] = 1;
        build(b);
        return 1;
    } else if(cnt[1] + cnt[0] == n * n) {
        mat = p;
        vis.resize(n, 0);

        for(int i=0; i<n; i++) {
            if(vis[i]) continue;
            dfs(i);
            for(int &u : curr)
                for(int &v : curr)
                    if(u != v) b[u][v] = 1;
            curr.clear();
        }

        build(b);
        return 1;
    }

    return 0;
}

// int32_t main() {
//     setIO();

//     int n;
//     cin >> n;

//     vector<vector<int> > p(n, vector<int>(n));
//     for(int i=0; i<n; i++)
//         for(int j=0; j<n; j++) cin >> p[i][j];

//     cout << construct(p) << '\n';
//     return 0;
// }

Compilation message

supertrees.cpp: In function 'void dfs(int)':
supertrees.cpp:39:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=0; i<mat.size(); i++) {
      |                  ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 149 ms 22120 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 149 ms 22120 KB Output is correct
8 Correct 0 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 7 ms 1516 KB Output is correct
13 Correct 154 ms 27928 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 432 KB Output is correct
5 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 149 ms 22120 KB Output is correct
8 Correct 0 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 7 ms 1516 KB Output is correct
13 Correct 154 ms 27928 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 149 ms 22120 KB Output is correct
8 Correct 0 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 7 ms 1516 KB Output is correct
13 Correct 154 ms 27928 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -