oj.uz

Submission #949995

# Submission time Handle Problem Language Result Execution time Memory
949995 2024-03-20T02:45:00 Z irmuun Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 174 ms 24144 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++){
            if(i==j) continue;
            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[1]&&!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:49:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 for(int j=1;j<ver.size();j++){
      |                             ~^~~~~~~~~~~
supertrees.cpp:85:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 169 ms 22040 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 169 ms 22040 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 145 ms 22024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 69 ms 12056 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 5732 KB Output is correct
21 Correct 148 ms 22096 KB Output is correct
22 Correct 153 ms 22020 KB Output is correct
23 Correct 150 ms 22100 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 63 ms 12040 KB Output is correct
26 Correct 59 ms 12024 KB Output is correct
27 Correct 172 ms 22020 KB Output is correct
28 Correct 146 ms 22096 KB Output is correct

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
5 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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 38 ms 6140 KB Output is correct
5 Correct 174 ms 23900 KB Output is correct
6 Correct 146 ms 23892 KB Output is correct
7 Correct 150 ms 24144 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 39 ms 6228 KB Output is correct
10 Correct 166 ms 24052 KB Output is correct
11 Correct 158 ms 24056 KB Output is correct
12 Correct 160 ms 24016 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
15 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 169 ms 22040 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 145 ms 22024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 69 ms 12056 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 5732 KB Output is correct
21 Correct 148 ms 22096 KB Output is correct
22 Correct 153 ms 22020 KB Output is correct
23 Correct 150 ms 22100 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 63 ms 12040 KB Output is correct
26 Correct 59 ms 12024 KB Output is correct
27 Correct 172 ms 22020 KB Output is correct
28 Correct 146 ms 22096 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 6 ms 1116 KB Output is correct
7 Correct 169 ms 22040 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 145 ms 22024 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 500 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 69 ms 12056 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 5732 KB Output is correct
21 Correct 148 ms 22096 KB Output is correct
22 Correct 153 ms 22020 KB Output is correct
23 Correct 150 ms 22100 KB Output is correct
24 Correct 148 ms 22020 KB Output is correct
25 Correct 63 ms 12040 KB Output is correct
26 Correct 59 ms 12024 KB Output is correct
27 Correct 172 ms 22020 KB Output is correct
28 Correct 146 ms 22096 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -