oj.uz

Submission #949964

# Submission time Handle Problem Language Result Execution time Memory
949964 2024-03-20T01:34:35 Z irmuun Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 173 ms 22104 KB 
#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int construct(vector<vector<int>>p){
    int n=p.size();
    bool a[4];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            a[p[i][j]]=true;
        }
    }
    vector<vector<int>>b(n,vector<int>(n,0));
    if(!a[2]&&!a[3]){
        vector<bool>used(n,0);
        vector<int>ver;
        for(int i=0;i<n;i++){
            if(!used[i]){
                queue<int>q;
                q.push(i);
                used[i]=true;
                while(!q.empty()){
                    int x=q.front();
                    ver.pb(x);
                    q.pop();
                    for(int j=0;j<n;j++){
                        if(p[x][j]==1&&!used[j]){
                            used[j]=true;
                            q.push(j);
                        }
                    }
                }
                for(auto x:ver){
                    for(auto y:ver){
                        if(x!=y&&p[x][y]!=1){
                            return 0;
                        }
                    }
                }
                for(int j=1;j<ver.size();j++){
                    b[ver[j]][ver[j-1]]=1;
                    b[ver[j-1]][ver[j]]=1;
                }
                ver.clear();
            }
        }
        build(b);
        return 1;
    }
    if(a[0]&&!a[1]&&a[2]&&!a[3]){
        vector<bool>used(n,0);
        vector<int>ver;
        for(int i=0;i<n;i++){
            if(!used[i]){
                queue<int>q;
                q.push(i);
                used[i]=true;
                while(!q.empty()){
                    int x=q.front();
                    ver.pb(x);
                    q.pop();
                    for(int j=0;j<n;j++){
                        if(p[x][j]==2&&!used[j]){
                            used[j]=true;
                            q.push(j);
                        }
                    }
                }
                for(auto x:ver){
                    for(auto y:ver){
                        if(x!=y&&p[x][y]!=2){
                            return 0;
                        }
                    }
                }
                for(int j=1;j<ver.size();j++){
                    b[ver[j]][ver[j-1]]=1;
                    b[ver[j-1]][ver[j]]=1;
                }
                if(ver.size()>1){
                    b[ver[0]][ver.back()]=1;
                    b[ver.back()][ver[0]]=1;
                }
                ver.clear();
            }
        }
        build(b);
        return 1;
    }
    return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1116 KB Output is correct
7 Correct 173 ms 21968 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 148 ms 22080 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 68 ms 12116 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5692 KB Output is correct
21 Correct 147 ms 22096 KB Output is correct
22 Correct 150 ms 22104 KB Output is correct
23 Correct 149 ms 22100 KB Output is correct
24 Correct 159 ms 22024 KB Output is correct
25 Correct 66 ms 12052 KB Output is correct
26 Correct 56 ms 12112 KB Output is correct
27 Correct 150 ms 22024 KB Output is correct
28 Correct 165 ms 21960 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Incorrect 1 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 1 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1116 KB Output is correct
7 Correct 173 ms 21968 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 148 ms 22080 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 68 ms 12116 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5692 KB Output is correct
21 Correct 147 ms 22096 KB Output is correct
22 Correct 150 ms 22104 KB Output is correct
23 Correct 149 ms 22100 KB Output is correct
24 Correct 159 ms 22024 KB Output is correct
25 Correct 66 ms 12052 KB Output is correct
26 Correct 56 ms 12112 KB Output is correct
27 Correct 150 ms 22024 KB Output is correct
28 Correct 165 ms 21960 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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 1116 KB Output is correct
7 Correct 173 ms 21968 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 148 ms 22080 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 68 ms 12116 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 38 ms 5692 KB Output is correct
21 Correct 147 ms 22096 KB Output is correct
22 Correct 150 ms 22104 KB Output is correct
23 Correct 149 ms 22100 KB Output is correct
24 Correct 159 ms 22024 KB Output is correct
25 Correct 66 ms 12052 KB Output is correct
26 Correct 56 ms 12112 KB Output is correct
27 Correct 150 ms 22024 KB Output is correct
28 Correct 165 ms 21960 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Incorrect 1 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -