Submission #656400

#	Time	Username	Problem	Language	Result	Execution time	Memory
656400		ssense	Connecting Supertrees (IOI20_supertrees)	C++14	Compilation error	0 ms	0 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int p[1005];
int sz[1005];

void init(int n)
{
    for(int i = 0; i < n; i++)
    {
        p[i] = i;
        sz[i] = i;
    }
}

int find(int i)
{
    if(i != p[i])
    {return find(p[i]);}
    return i;
}

void usets(int u, int v)
{
    if(sz[u] <= sz[v])
    {
        swap(u, v);
    }
    p[find(v)] = find(u);
}


int construct(int[][] p)
{
    int n = sizeof(p[0])/sizeof(p[0][0]);
    init(1000);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 1)
            {
                usets(i, j);
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 0 && find(i) == find(j))
            {
                return 0;
            }
        }
    }
    int build[n][n];
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            build[i][j] = 0;
        }
    }
    vector<bool> vis(n, false);
    for(int i = 0; i < n; i++)
    {
        int now = i;
        while(!vis[now])
        {
            vis[now] = true;
            build[now][p[now]] = 1;
            now = p[now];
        }
    }
    build(b);
    return 1;
}

Compilation message (stderr)

supertrees.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
supertrees.cpp:21:667: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
supertrees.cpp: At global scope:
supertrees.cpp:52:21: error: multidimensional array must have bounds for all dimensions except the first
   52 | int construct(int[][] p)
      |                     ^
supertrees.cpp:52:23: error: expected ',' or '...' before 'p'
   52 | int construct(int[][] p)
      |                       ^
supertrees.cpp: In function 'long long int construct()':
supertrees.cpp:54:37: error: invalid types 'long long int[int]' for array subscript
   54 |     int n = sizeof(p[0])/sizeof(p[0][0]);
      |                                     ^
supertrees.cpp:60:20: error: invalid types 'long long int[long long int]' for array subscript
   60 |             if(p[i][j] == 1)
      |                    ^
supertrees.cpp:70:20: error: invalid types 'long long int[long long int]' for array subscript
   70 |             if(p[i][j] == 0 && find(i) == find(j))
      |                    ^
supertrees.cpp:95:11: error: 'b' was not declared in this scope
   95 |     build(b);
      |           ^
supertrees.cpp:95:12: error: 'build' cannot be used as a function
   95 |     build(b);
      |            ^